Nearly tight bounds on the encoding length of the burrows-wheeler transform

Proceedings of the 10th Workshop on Algorithm Engineering and Experiments and the 5th Workshop on Analytic Algorithmics and Combinatorics

Volumn , Issue , 2008, Pages 191-202

  Gupta, Ankur ^a   Grossi, Roberto ^b   Vitter, Jeffrey Scott ^c  

^a BUTLER UNIVERSITY   (United States)

^b UNIVERSITY OF PISA   (Italy)

^c Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BACKWARD WAVE TUBES; DECODING; SIGNAL ENCODING;

BURROWS-WHEELER TRANSFORM; ENCODING AND DECODING; ENCODING SCHEMES; ENCODINGS; LINEAR TIME; LOW BOUND; NON-TRIVIAL; TEXT-INDEXING; TIGHT BOUND; UPPER BOUND;

ENCODING (SYMBOLS);

EID: 58349089780     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972986.3     Document Type: Conference Paper

References (20)

1. D. Baron and Y. Bresler. An o(n) semipredictive universal encoder via the bwt. IEEE Transactions on Information Theory. 50:928-937, 2004.
2. M. Burrows and D.J. Wheeler. A block sorting data compression algorithm. Technical report, Digital Systems Research Center, 1994.
3. Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. Wiley-Interscience, New York, 1991.
4. Peter Elias. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, IT-21:194-203, 1975.
5. Michelle Effros, Karthik Visweswariah, Sanjeev R. Kulkarni, and Sergio Verdu. Universal lossless source coding with the burrows-wheeler transform. IEEE lransactions on Information Theory, 48(5):1061-1081, 2002.
6. William Feller. An Introduction to Probability Theory and its Applications, volume 1. John Wiley & Sons, New York, 3rd edition, 1968.
7. Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini, and Gabriella Sciortino. Boosting textual compression in optimal linear time. Journal of the ACM, 52(4):688-713, 2005. (Also in CPM 2003, ACM-SIAM SODA 2004.).
8. Paolo Ferragina and Giovanni Manzini. On compressing and indexing data. Journal of the ACM, 52(4):552-581, 2005. (Also in IEEE FOCS 2000.).
9. Roberto Grossi, Ankur Gupta, and Jeffrey Scott Vitter. High-order entropy-compressed text indexes. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, January 2003.
10. Roberto Grossi and Jeffrey Scott Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM Journal on Computing, 35(2):378-407, 2005.
11. Paul G. Howard and Jeffrey Scott Vitter. Arithmetic coding for data compression. Proceedings of the IEEE, 82(6), June 1994.
12. Haim Kaplan, Shir Landau, and Elad Verbin. A simpler analysis of burrows-wheeler based compression, pages 282-293, 2006.
13. S. Rao Kosaraju and Giovanni Manzini. Compression of low entropy strings with lempel-ziv algorithms. SIAM J. Comput., 29(3):893-911, 1999.
14. Donald E. Knuth. Combinatorial Algorithms, volume 4 of The Art of Computer Programming. Addison-Wesley, Reading, MA, USA, 2005. In preparation.
15. Giovanni Manzini. An analysis of the Burrows - Wheeler transform. Journal of the ACM, 48(3):407-430, May 2001.
16. Gonzalo Navarro and Veli Mäkinen. Compressed full-text indexes. 2006. To appear.
17. Frank Ruskey. Combinatorial Generation. 2005. In preparation.
18. Claude E. Shannon. A mathematical theory of communication. Bell System Technical Journal, 27:379-423, July 1948.
19. Jeffrey Scott Vitter. Faster methods for random sampling. Communications of the ACM, 27(7):703-718, July 1984.
20. Marcelo J. Weinberger, Neri Merhav, and Meir Feder. Optimal sequential probability assignment for individual sequences. IEEE Transactions on Information Theory, 40:384-396, 1994.