Average-sense optimality and competitive optimality for almost instantaneous VF codes

DOI10.1109/18.945241MaRDI QIDQ4544662zbMATH OpenOpenAlexFDO

Authors Hirosuke Yamamoto, Hidetoshi Yokoo

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/0780c251942c2fe587f81ed70d292f077da4c3e4

zbMATH Keywords

almost instantaneous variable-to-fixed length codescompetitive optimalityone-shot codingTunstall code

Mathematics Subject Classification ID

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

Recommendations

• Competitive optimality of source codes
• Optimal universal coding with respect to the maximal individual relative redundancy criterion
• scientific article; zbMATH DE number 2036351
• On the competitive optimality of Huffman codes
• Optimum '1'-ended binary prefix codes

Cited in

(2)

• An efficient variable-to-fixed length encoding using multiplexed parse trees
• Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries

This page was built for publication: Average-sense optimality and competitive optimality for almost instantaneous VF codes

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