Bounds on the redundancy of binary alphabetical codes

DOI10.1109/18.86980zbMATH Open0733.94010OpenAlexW2104740387MaRDI QIDQ3360787FDOQ3360787

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

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.)

zbMATH Keywords

redundancyHuffman codesource codingalphabetical code

Mathematics Subject Classification ID

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

Cited In (10)

• Title not available (Why is that?)
• A lower-bound for the maximin redundancy in pattern coding
• On lower bounds for the redundancy of optimal codes
• Alphabetic coding with exponential costs
• Minimax trees in linear time with applications
• Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
• Title not available (Why is that?)
• Operations research applications of dichotomous search
• On the redundancy of lossy source coding with abstract alphabets
• Bounds for binary codes of length less than 25

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)