Housekeeping for prefix coding

DOI10.1109/26.843129MaRDI QIDQ2732984zbMATH OpenOpenAlexFDO

Authors Andrew Turpin, Alistair Moffat

Publication date 2 December 2001

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/8fd23d6b8cd994c35799d40038c288d5b12cf0ba

zbMATH Keywords

adaptive codingcanonical codeHuffman codingminimum-redundancy codeprefix code

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)

Recommendations

• Dynamic huffman coding
• Fast and Compact Prefix Codes
• scientific article; zbMATH DE number 1091469
• scientific article; zbMATH DE number 4049549
• On-line adaptive canonical prefix coding with bounded compression loss

Cited in

(1)

• Binary codes for locally homogeneous sequences

This page was built for publication: Housekeeping for prefix coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2732984)