Efficient and compact representations of some non-canonical prefix-free codes

DOI10.1007/978-3-319-46049-9_5zbMath1397.68069arXiv1605.06615OpenAlexW2394666113MaRDI QIDQ5916286

Giovanni Manzini, Gonzalo Navarro, Alberto Ordóñez, Antonio Fariña, Travis Gagie

Publication date: 17 October 2018

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.06615

Mathematics Subject Classification ID

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

Related Items (2)

Efficient and compact representations of some non-canonical prefix-free codes ⋮ Space-efficient Huffman codes revisited

This page was built for publication: Efficient and compact representations of some non-canonical prefix-free codes