Move-to-front, distance coding, and inversion frequencies revisited
DOI10.1016/J.TCS.2010.04.024zbMATH Open1203.94084OpenAlexW2109122310MaRDI QIDQ982665FDOQ982665
Authors: Travis Gagie, Giovanni Manzini 
Publication date: 7 July 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.024
Recommendations
- Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
- scientific article; zbMATH DE number 1744171
- Decoding Frequency Permutation Arrays Under Chebyshev Distance
- Coding Theory: A General Framework and Two Inverse Problems
- Distance spectra of convolutional codes over partial-response channels
- A Revisit to Ordered Statistics Decoding: Distance Distribution and Decoding Rules
- scientific article; zbMATH DE number 4183337
- On the spectrum of distances of a multilevel code, decoded by a multistage decoder
- Inversion Coding
- Invertible Low-Divergence Coding
Measures of information, entropy (94A17) Source coding (94A29) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Application of orthogonal and other special functions (94A11)
Cites Work
- Title not available (Why is that?)
- A locally adaptive data compression scheme
- Title not available (Why is that?)
- Compressed representations of sequences and full-text indexes
- An analysis of the Burrows-Wheeler transform
- Universal codeword sets and representations of the integers
- Title not available (Why is that?)
- Title not available (Why is that?)
- The myriad virtues of wavelet trees
- A simpler analysis of Burrows-Wheeler-based compression
- Most Burrows-Wheeler Based Compressors Are Not Optimal
- Boosting textual compression in optimal linear time
- The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
- Inversion Coding
- Universal lossless source coding with the Burrows Wheeler transform
- Nearly tight bounds on the encoding length of the Burrows-Wheeler transform
- When indexing equals compression
- Burrows-Wheeler compression with variable length integer codes
- Second step algorithms in the Burrows-Wheeler compression algorithm
- Lexical Permutation Sorting Algorithm
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Move-to-front, distance coding, and inversion frequencies revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q982665)
