Interval and recency rank source coding: Two on-line adaptive variable-length schemes

DOI10.1109/TIT.1987.1057251MaRDI QIDQ3765700zbMATH OpenFDO

Authors Peter Eliaš

Publication date 1987

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

zbMATH Keywords

interval encodingon-line adaptive variable-length source codingrecency rank encoding

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Fast adaptive coding algorithm
• Publication:4206688
• scientific article; zbMATH DE number 3557667
• Fixed-prefix encoding of the integers can be Huffman-optimal
• scientific article; zbMATH DE number 3463523

Cited in

(7)

• A universal statistical test for random bit generators
• Two conjectures about recency rank encoding
• Universal coding for memoryless sources with countably infinite alphabets
• Medical image compression and vector quantization
• Second step algorithms in the Burrows-Wheeler compression algorithm
• Investigation of block-sorting of multiset permutations
• Using information theory approach to randomness testing

This page was built for publication: Interval and recency rank source coding: Two on-line adaptive variable-length schemes

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