Bounding the inefficiency of length-restricted prefix codes

DOI10.1007/S00453-001-0060-4zbMath1012.94008OpenAlexW106140241MaRDI QIDQ5953598

Eduardo Sany Laber, Ruy Luiz Milidiú

Publication date: 10 June 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0060-4

zbMATH Keywords

compressionredundancyprefix codesapproximative algorithmHuffman trees

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Prefix, length-variable, comma-free codes (94A45) Algorithms in computer science (68W99)

Related Items (6)

Trading off worst and expected cost in decision tree problems ⋮ Colored range queries and document retrieval ⋮ On compressing permutations and adaptive sorting ⋮ Exact and approximation algorithms for error-detecting even codes ⋮ A note on the construction of error detecting/correcting prefix codes ⋮ Parity codes

This page was built for publication: Bounding the inefficiency of length-restricted prefix codes