A fast and efficient nearly-optimal adaptive Fano coding scheme

DOI10.1016/J.INS.2005.07.010MaRDI QIDQ2489208zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Luis G. Rueda, B. John Oommen

Publication date 16 May 2006

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2005.07.010

zbMATH Keywords

Adaptive codingData compressionFano coding

Mathematics Subject Classification ID

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

Recommendations

• A nearly-optimal Fano-based coding algorithm
• scientific article; zbMATH DE number 1630078
• Publication:4945375
• On-line adaptive canonical prefix coding with bounded compression loss
• Fast arithmetic coding algorithm of data compression

Cites work

• A Method for the Construction of Minimum-Redundancy Codes
• A nearly-optimal Fano-based coding algorithm
• A universal algorithm for sequential data compression
• A universal predictor based on pattern matching
• Compression of individual sequences via variable-rate coding
• Design and analysis of dynamic Huffman codes
• Dynamic huffman coding
• Grammar-based codes: a new class of universal lossless source codes
• scientific article; zbMATH DE number 3476581 (Why is no real title available?)
• scientific article; zbMATH DE number 1049269 (Why is no real title available?)
• On delayed prediction of individual sequences
• On the performance of recency-rank and block-sorting universal lossless data compression algorithms
• Two classes of ternary codes and their weight distributions
• Universal lossless source coding with the Burrows Wheeler transform
• Variations on a theme by Huffman

Cited in

(10)

• A nearly-optimal Fano-based coding algorithm
• A fast algorithm for adaptive prefix coding
• scientific article; zbMATH DE number 1630078 (Why is no real title available?)
• Worst-Case Optimal Adaptive Prefix Coding
• Fast decoding algorithms for variable-lengths codes
• The memory center
• Dynamic Shannon coding
• Fine-granularity loading schemes using adaptive Reed-Solomon coding for xDSL-DMT systems
• An adaptive character wordlength algorithm for data compression
• A novel lossless data compression scheme based on the error correcting Hamming codes

This page was built for publication: A fast and efficient nearly-optimal adaptive Fano coding scheme

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