Bounds on the redundancy of binary alphabetical codes

DOI10.1109/18.86980MaRDI QIDQ3360787zbMATH OpenOpenAlexFDO

Authors Narao Nakatsu

Publication date 1991

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

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

zbMATH Keywords

alphabetical codeHuffman coderedundancysource coding

Mathematics Subject Classification ID

Source coding (94A29) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Tight bounds on the redundancy of Huffman codes
• On lower bounds for the redundancy of optimal codes
• scientific article; zbMATH DE number 4210044
• New bounds on the redundancy of Huffman codes
• On the redundancy of binary Huffman codes (Corresp.)

Cited in

(12)

• On lower bounds for the redundancy of optimal codes
• Operations research applications of dichotomous search
• Minimax trees in linear time with applications
• Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
• scientific article; zbMATH DE number 4210044 (Why is no real title available?)
• Bounds for binary codes of length less than 25
• scientific article; zbMATH DE number 1260845 (Why is no real title available?)
• scientific article; zbMATH DE number 1083083 (Why is no real title available?)
• On the redundancy of lossy source coding with abstract alphabets
• Old and new results on alphabetic codes
• A lower-bound for the maximin redundancy in pattern coding
• Alphabetic coding with exponential costs

This page was built for publication: Bounds on the redundancy of binary alphabetical codes

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