On the public citation graph

Burrows–Wheeler compression with variable length integer codes

https://doi.org/10.1002/spe.484
0 signed · 27 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/1097-024x(20001110)30:13<1465::aid-spe345>3.0.co;2-dopenalex-snapshot
Improvements to Burrows-Wheeler compression algorithm
inferredcites →https://doi.org/10.1002/spe.426openalex-snapshot
Second step algorithms in the Burrows–Wheeler compression algorithm
inferredcites →https://doi.org/10.1016/0166-218x(93)00116-hopenalex-snapshot
Robust universal complete codes for transmission and 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.1109/dcc.1999.755668openalex-snapshot
Modifications of the Burrows and Wheeler data compression algorithm
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.2002.999990openalex-snapshot
Generalization of the BWT transformation and inversion ranks
inferredcites →https://doi.org/10.1109/tit.1975.1055349openalex-snapshot
Universal codeword sets and representations of the integers

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.2873openalex-snapshot
Burrows‐Wheeler post‐transformation with effective clustering and interpolative coding
inferred← citeshttps://doi.org/10.1002/spe.763openalex-snapshot
Incremental frequency count—a post BWT‐stage for the Burrows–Wheeler compression algorithm
inferred← citeshttps://doi.org/10.1002/spe.982openalex-snapshot
Post BWT stages of the Burrows–Wheeler compression algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_10openalex-snapshot
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
inferred← citeshttps://doi.org/10.1016/b978-012620861-0/50008-5openalex-snapshot
Burrows—Wheeler Compression
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.04.014openalex-snapshot
Binary codes for locally homogeneous sequences
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.012openalex-snapshot
Burrows–Wheeler compression: Principles and reflections
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.04.024openalex-snapshot
Move-to-Front, Distance Coding, and Inversion Frequencies revisited
inferred← citeshttps://doi.org/10.1049/el.2016.1605openalex-snapshot
Variable length integer codes based on radix number system conversion
inferred← citeshttps://doi.org/10.1093/comjnl/bxn030openalex-snapshot
Tournament Coding of Integer Sequences
inferred← citeshttps://doi.org/10.1109/dcc.2004.1281451openalex-snapshot
Fast compression with a static model in high-order entropy
inferred← citeshttps://doi.org/10.1109/tmm.2006.886260openalex-snapshot
Extended Golomb Code for Integer Representation
inferred← citeshttps://doi.org/10.1117/12.651697openalex-snapshot
The impact of lossless image compression to radiographs
inferred← citeshttps://doi.org/10.1145/1198513.1198521openalex-snapshot
When indexing equals compression
inferred← citeshttps://doi.org/10.17485/ijst/2015/v8i24/80242openalex-snapshot
A New Variable-Length Integer Code for Integer Representation and Its Application to Text Compression
inferred← citeshttps://doi.org/10.25209/2079-3316-2018-9-4-239-252openalex-snapshot
Vbinary: variable length integer coding revisited
inferred← citeshttps://doi.org/10.25209/2079-3316-2018-9-4-477-491openalex-snapshot
Vbinary: variable length integer coding revisited
inferred← citeshttps://doi.org/10.4018/ijirr.2013010105openalex-snapshot
Re-Ordered FEGC and Block Based FEGC for Inverted File Compression
inferred← citeshttps://doi.org/10.70675/242e223fze6acz4b28z8fe7z050f699ec127openalex-snapshot
Lossless and nearly-lossless image compression based on combinatorial transforms
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.