On the Maximum Size of a Prefix Code

DOI10.1109/TIT.2023.3236688MaRDI QIDQ6197466zbMATH OpenOpenAlexFDO

Authors Peter Horák, Viliam Hromada, Otokar Grošek

Publication date 19 March 2024

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

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

zbMATH Keywords

Huffman codingprefix codescipher based on a prefix codemaximum minimal dictionarypartitions of a natural number

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Cited in

(1)

• Structure of finite maximal prefix codes with constant average length 4

This page was built for publication: On the Maximum Size of a Prefix Code

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