Universal lossless source coding with the Burrows Wheeler transform

DOI10.1109/18.995542zbMath1061.94018OpenAlexW1993720950MaRDI QIDQ4674493

Sanjeev R. Kulkarni, Sergio Verdú, Karthik Visweswariah, Michelle Effros

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/

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)

Related Items (7)

The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words ⋮ On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation ⋮ A fast and efficient nearly-optimal adaptive Fano coding scheme ⋮ Move-to-front, distance coding, and inversion frequencies revisited ⋮ Universal codes as a basis for time series testing ⋮ Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series ⋮ Universal codes as a basis for nonparametric testing of serial independence for time series

This page was built for publication: Universal lossless source coding with the Burrows Wheeler transform