Burrows-Wheeler compression with variable length integer codes

DOI10.1002/spe.484zbMath1009.68927OpenAlexW2083335299MaRDI QIDQ4791043

Peter Fenwick

Publication date: 4 February 2003

Published in: Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/spe.484

zbMATH Keywords

Fibonacci codesuniversal codesBurrows-Wheeler compressionElias \(\gamma\) codesFraenkel-Klein codes

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) General topics in the theory of software (68N01)

Related Items (3)

Binary codes for locally homogeneous sequences ⋮ Burrows-Wheeler compression: Principles and reflections ⋮ Move-to-front, distance coding, and inversion frequencies revisited

This page was built for publication: Burrows-Wheeler compression with variable length integer codes