Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources

DOI10.1109/18.53746MaRDI QIDQ3487279zbMATH OpenOpenAlexFDO

Authors Jacob Ziv

Publication date 1990

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

Full work available at URL https://semanticscholar.org/paper/42a8492bd8141da5b515c8936085648de058b237

zbMATH Keywords

ergodic Markov sourcefixed-to-variable codeHuffman codevariable-to-fixed code

Mathematics Subject Classification ID

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

Recommendations

• Variable to fixed-length codes for Markov sources
• Universal variable-to-fixed length source codes
• scientific article; zbMATH DE number 5941301
• Variable-to-fixed length codes provide better large deviations performance than fixed-to-variable length codes
• Variable-to-fixed length codes and the conservation of entropy

Cited in

(8)

• An efficient variable-to-fixed length encoding using multiplexed parse trees
• Construction of symmetrical reversible variable length codes for a Markovian source
• scientific article; zbMATH DE number 5941301 (Why is no real title available?)
• Variable to fixed-length codes for Markov sources
• Variable-to-fixed length codes provide better large deviations performance than fixed-to-variable length codes
• Universal variable-to-fixed length source codes
• Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources
• Variable-to-fixed length codes and the conservation of entropy

This page was built for publication: Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources

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