Universal lossless source coding with the Burrows Wheeler transform
DOI10.1109/18.995542zbMATH Open1061.94018OpenAlexW1993720950MaRDI QIDQ4674493FDOQ4674493
Authors: Michelle Effros, Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio Verdú 
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://authors.library.caltech.edu/1330/
Recommendations
- Universal data compression based on the Burrows-Wheeler transformation: theory and practice
- Universal Lossless Coding for Sources With Repeating Statistics
- scientific article; zbMATH DE number 5010756
- Fixed-slope universal lossy data compression
- Lossless Source Coding Using Nested Error Correcting Codes
- Universal lossless compression via multilevel pattern matching
- On the redundancy of universal lossless coding for general piecewise stationary sources
- Universal Compression of Memoryless Sources Over Unknown Alphabets
- Universal coding for discrete memoryless sources uniform with respect to output
Source coding (94A29) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cited In (18)
- Burrows-Wheeler compression: Principles and reflections
- On undetected redundancy in the Burrows-Wheeler transform
- The Burrows-Wheeler transform between data compression and combinatorics on words
- Universal data compression based on the Burrows-Wheeler transformation: theory and practice
- Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
- Move-to-front, distance coding, and inversion frequencies revisited
- Title not available (Why is that?)
- Extension and faster implementation of the GRP transform for lossless compression
- Inversion Coding
- Universal codes as a basis for nonparametric testing of serial independence for time series
- A fast and efficient nearly-optimal adaptive Fano coding scheme
- On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
- Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
- Most Burrows-Wheeler Based Compressors Are Not Optimal
- Title not available (Why is that?)
- Universal codes as a basis for time series testing
- Universal Entropy Estimation Via Block Sorting
- Burrows-Wheeler compression with variable length integer codes
This page was built for publication: Universal lossless source coding with the Burrows Wheeler transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4674493)
