Bounds on the redundancy of binary alphabetical codes

DOI10.1109/18.86980zbMath0733.94010OpenAlexW2104740387MaRDI QIDQ3360787

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

redundancyHuffman codesource codingalphabetical code

Mathematics Subject Classification ID

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

Related Items (3)

Operations research applications of dichotomous search ⋮ Minimax trees in linear time with applications ⋮ Alphabetic coding with exponential costs

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