Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform

DOI10.1137/1.9781611972986.3zbMath1429.68070OpenAlexW1538995865MaRDI QIDQ5194644

Ankur Gupta, Roberto Grossi, Jeffrey Scott Vitter

Publication date: 16 September 2019

Published in: 2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/01722f4b7c40b1c96e1871f4876bb5a8808f06f0

Mathematics Subject Classification ID

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

Related Items (1)

Move-to-front, distance coding, and inversion frequencies revisited

This page was built for publication: Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform