Sufficient Conditions for Existence of Binary Fix-Free Codes

DOI10.1109/TIT.2005.855581MaRDI QIDQ3547189zbMATH OpenFDO

Authors Zsolt Kukorelly, Kenneth Zeger

Publication date 21 December 2008

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

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

zbMATH Keywords

Huffman codeslossless source codingreversible codes

Mathematics Subject Classification ID

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

Recommendations

• Multiplied complete fix-free codes and shiftings regarding the 3/4-conjecture
• Complete variable-length ``fix-free codes
• Some basic properties of fix-free codes
• On maximal prefix codes.
• On the 3/4-conjecture for fix-free codes

Cites work

• A Kraft-Type Sufficient Condition for the Existence of $D$-Ary Fix-Free Codes
• Improved Upper Bound for the Redundancy of Fix-Free Codes
• Reversible variable length codes
• Some basic properties of fix-free codes
• Sufficient Conditions for Existence of Binary Fix-Free Codes

Cited in

(6)

• Complete variable-length ``fix-free codes
• Sufficient Conditions for Existence of Binary Fix-Free Codes
• On the 3/4-conjecture for fix-free codes
• Some basic properties of fix-free codes
• Multiplied complete fix-free codes and shiftings regarding the 3/4-conjecture
• The existence and synchronization properties of symmetric fix-free codes

This page was built for publication: Sufficient Conditions for Existence of Binary Fix-Free Codes

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