On the public citation graph

Burrows‐Wheeler post‐transformation with effective clustering and interpolative coding

https://doi.org/10.1002/spe.2873
0 signed · 34 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/spe.2556openalex-snapshot
Compact inverted index storage using general‐purpose compression libraries
inferredcites →https://doi.org/10.1002/spe.426openalex-snapshot
Second step algorithms in the Burrows–Wheeler compression algorithm
inferredcites →https://doi.org/10.1002/spe.484openalex-snapshot
Burrows–Wheeler compression with variable length integer codes
inferredcites →https://doi.org/10.1002/spe.763openalex-snapshot
Incremental frequency count—a post BWT‐stage for the Burrows–Wheeler compression algorithm
inferredcites →https://doi.org/10.1002/spe.982openalex-snapshot
Post BWT stages of the Burrows–Wheeler compression algorithm
inferredcites →https://doi.org/10.1007/11841036_67openalex-snapshot
The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
inferredcites →https://doi.org/10.1007/3-540-45061-0_73openalex-snapshot
Simple Linear Work Suffix Array Construction
inferredcites →https://doi.org/10.1007/978-0-387-78909-5openalex-snapshot
The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching
inferredcites →https://doi.org/10.1007/978-1-84882-903-9openalex-snapshot
Handbook of Data Compression
inferredcites →https://doi.org/10.1016/b978-012620861-0/50004-8openalex-snapshot
Universal Codes
inferredcites →https://doi.org/10.1016/b978-012620861-0/50008-5openalex-snapshot
Burrows—Wheeler Compression
inferredcites →https://doi.org/10.1016/j.ins.2018.01.045openalex-snapshot
Efficient chain code compression with interpolative coding
inferredcites →https://doi.org/10.1016/j.ipl.2005.03.008openalex-snapshot
Context exhumation after the Burrows–Wheeler transform
inferredcites →https://doi.org/10.1016/j.tcs.2007.07.012openalex-snapshot
Burrows–Wheeler compression: Principles and reflections
inferredcites →https://doi.org/10.1023/a:1013002601898openalex-snapshot
Binary Interpolative Coding for Effective Index Compression
inferredcites →https://doi.org/10.1093/comjnl/39.9.731openalex-snapshot
The Burrows-Wheeler Transform for Block Sorting Text Compression: Principles and Improvements
inferredcites →https://doi.org/10.1093/comjnl/bxn030openalex-snapshot
Tournament Coding of Integer Sequences
inferredcites →https://doi.org/10.1109/dcc.1998.672253openalex-snapshot
Higher compression from the Burrows-Wheeler transform by modified sorting
inferredcites →https://doi.org/10.1109/dcc.1998.672295openalex-snapshot
Preprocessing text to improve compression ratios
inferredcites →https://doi.org/10.1109/dcc.2000.838159openalex-snapshot
Move-to-front and inversion coding
inferredcites →https://doi.org/10.1109/dcc.2001.917173openalex-snapshot
Can we do without ranks in Burrows Wheeler transform compression?
inferredcites →https://doi.org/10.1109/dcc.2005.3openalex-snapshot
A Fast and Efficient Post BWT-Stage for the Burrows-Wheeler Compression Algorithm
inferredcites →https://doi.org/10.1109/tit.1966.1053907openalex-snapshot
Run-length encodings (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1975.1055349openalex-snapshot
Universal codeword sets and representations of the integers
inferredcites →https://doi.org/10.1145/1082036.1082043openalex-snapshot
Boosting textual compression in optimal linear time
inferredcites →https://doi.org/10.1145/5684.5688openalex-snapshot
A locally adaptive data compression scheme

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4519773openalex-extracted
inferred← citeshttps://doi.org/10.1063/5.0296505openalex-snapshot
Development of application programming interface for automatic identification system data
inferred← citeshttps://doi.org/10.1093/comjnl/bxaf023openalex-snapshot
Compression Cryptosystem
inferred← citeshttps://doi.org/10.1109/iemcon51383.2020.9284917openalex-snapshot
Burrows-Wheeler Transformation for Medical Image Compression
inferred← citeshttps://doi.org/10.1109/netapps63333.2024.10823593openalex-snapshot
Comparative Analysis of Data Compression and Communication Algorithms
inferred← citeshttps://doi.org/10.1145/3673791.3698419openalex-snapshot
Binary Interpolative Coding Revisited
inferred← citeshttps://doi.org/10.21203/rs.3.rs-1655438/v1openalex-snapshot
Burrows-Wheeler Post-Transformation with Effective Clustering and Integer Coding Through Vectorization
inferred← citeshttps://doi.org/10.3390/bdcc10050140openalex-snapshot
BWT-Enhanced Compression for GIS Raster Data: A Hybrid AV1-Inspired Approach with Burrows–Wheeler Transform
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.