Some basic properties of fix-free codes

DOI10.1109/18.904513MaRDI QIDQ4544455zbMATH OpenOpenAlexFDO

Authors Chunxuan Ye, Raymond W. Yeung

Publication date 4 August 2002

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

Full work available at URL https://semanticscholar.org/paper/1e07077e38a654c98cbe1eab8497cf0159e15fed

zbMATH Keywords

redundancydecodingfix-free codedata decompression

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Complete variable-length ``fix-free codes
• Universal variable-to-fixed length source codes
• Sufficient Conditions for Existence of Binary Fix-Free Codes
• The existence and synchronization properties of symmetric fix-free codes
• On the construction of prefix-free and fix-free codes with specified codeword compositions

Cited in

(6)

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

This page was built for publication: Some basic properties of fix-free codes

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