A nearly-optimal Fano-based coding algorithm

DOI10.1016/S0306-4573(03)00007-4MaRDI QIDQ1881249zbMATH OpenDBLPWikidataFDO

Authors Luis G. Rueda, B. John Oommen

Publication date 4 October 2004

Published in Information Processing and Management (Search for Journal in Brave)

zbMATH Keywords

Huffman's algorithmstatistical coding techniques

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• A fast and efficient nearly-optimal adaptive Fano coding scheme
• scientific article; zbMATH DE number 1091469
• Forward looking Huffman coding
• Arithmetic coding with folds and unfolds
• Algorithms – ESA 2004

Cited in

(4)

• A new class of near-optimal partial Fourier codebooks from an almost difference set
• Fractional Repetition Codes With Optimal Reconstruction Degree
• A fast and efficient nearly-optimal adaptive Fano coding scheme
• An adaptive character wordlength algorithm for data compression

This page was built for publication: A nearly-optimal Fano-based coding algorithm

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