Adaptive coding for data compression

MaRDI QIDQ2729858zbMATH OpenFDO

Authors Andrew Turpin, Alistair Moffat

Publication date 4 October 2001

zbMATH Keywords

data compression

Mathematics Subject Classification ID

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

Recommendations

• Efficient method of adaptive arithmetic coding for sources with large alphabets
• A fast and efficient nearly-optimal adaptive Fano coding scheme
• Fast and space-efficient adaptive arithmetic coding
• On-line adaptive canonical prefix coding with bounded compression loss
• Fast adaptive coding algorithm

Cited in

(15)

• Hierarchical dictionary model and dictionary management policies for data compression
• Efficient method of adaptive arithmetic coding for sources with large alphabets
• A fast and efficient nearly-optimal adaptive Fano coding scheme
• Bidirectional adaptive compression
• scientific article; zbMATH DE number 3959271 (Why is no real title available?)
• Data compression
• scientific article; zbMATH DE number 49083 (Why is no real title available?)
• scientific article; zbMATH DE number 3552382 (Why is no real title available?)
• Tunstall adaptive coding and miscoding
• Error-Resilient Optimal Data Compression
• On-line adaptive canonical prefix coding with bounded compression loss
• scientific article; zbMATH DE number 943387 (Why is no real title available?)
• scientific article; zbMATH DE number 1859209 (Why is no real title available?)
• scientific article; zbMATH DE number 5170141 (Why is no real title available?)
• The sound of silence: Guessing games for saving energy in a mobile environment

This page was built for publication: Adaptive coding for data compression

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