Binary codes for locally homogeneous sequences

DOI10.1016/J.IPL.2006.04.014zbMath1185.68325OpenAlexW2058422563MaRDI QIDQ845715

Vo Ngoc Anh, Alistair Moffat

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.04.014

zbMATH Keywords

algorithmsinformation retrievalcompressioncodingHuffman codeElias codelocally adaptive codeminimum-redundancy code

Mathematics Subject Classification ID

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

Cites Work

• A compression method for clustered bit-vectors
• Housekeeping for prefix coding
• Universal codeword sets and representations of the integers
• Burrows-Wheeler compression with variable length integer codes
• Run-length encodings (Corresp.)
• Unnamed Item

This page was built for publication: Binary codes for locally homogeneous sequences