Fixed-prefix encoding of the integers can be Huffman-optimal

DOI10.1109/18.53761MaRDI QIDQ3489930zbMATH OpenOpenAlexFDO

Authors Michael Gutman

Publication date 1990

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

Full work available at URL https://doi.org/10.1109/18.53761

zbMATH Keywords

fixed-prefix encodingHuffman codingsource coding schemes

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Optimal Prefix Codes And Huffman Codes
• scientific article; zbMATH DE number 4049549
• Almost asymptotically optimal flag encoding of the integers
• A fast algorithm for optimal length-limited Huffman codes
• Optimal source coding for a class of integer alphabets (Corresp.)
• Compressing prefix code by the means of low \((2,3)\)-representation of numbers
• Efficient and Compact Representations of Prefix Codes
• Simple bounds on the numbers of binary Huffman sequences
• Optimal prefix codes with fewer distinct codeword lengths are faster to construct
• Efficient Huffman decoding

Cited in

(6)

• New bounds on \(D\)-ary optimal codes
• Robust prefix encoding using lower (2,3) number representation
• Two conjectures about recency rank encoding
• Interval and recency rank source coding: Two on-line adaptive variable-length schemes
• Almost asymptotically optimal flag encoding of the integers
• Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees

This page was built for publication: Fixed-prefix encoding of the integers can be Huffman-optimal

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