Efficient and Compact Representations of Prefix Codes

DOI10.1109/TIT.2015.2452252zbMath1359.94090arXiv1410.3438OpenAlexW2963038178MaRDI QIDQ2977298

Alberto Ordóñez, Travis Gagie, Yakov Nekrich, Gonzalo Navarro

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Information theory (general) (94A15)

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 Prefix Codes