Efficient method of adaptive arithmetic coding for sources with large alphabets

MaRDI QIDQ1569285zbMATH OpenFDO

Authors A. N. Fionov, B. Ya. Ryabko

Publication date 5 May 2002

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

data compressionarithmetic codingdecodingencodingadaptive arithmetic codeimaginary sliding windowlarge source alphabet

Mathematics Subject Classification ID

Source coding (94A29) Decoding (94B35) Arithmetic codes (94B40)

Recommendations

• Publication:4945375
• Linear time adaptive arithmetic coding
• Fast and efficient coding of information sources
• scientific article; zbMATH DE number 1630078
• Multi-alphabet universal coding of memoryless sources

Cited in

(13)

• scientific article; zbMATH DE number 1630078 (Why is no real title available?)
• Efficient multiplication-free arithmetic codes
• Adaptive Coding and Prediction of Sources With Large and Infinite Alphabets
• Dynamic pipeline design of an adaptive binary arithmetic coder
• Fast arithmetic coding algorithm of data compression
• Linear time adaptive arithmetic coding
• Adaptive arithmetic coding using fuzzy reasoning and grey prediction
• An efficient coding system for long source sequences
• Arithmetic coding with dual symbol sets and its performance analysis
• A fast algorithm for adaptive prefix coding
• Fast codes for large alphabets
• scientific article; zbMATH DE number 1424178 (Why is no real title available?)
• Large Alphabet Source Coding Using Independent Component Analysis

This page was built for publication: Efficient method of adaptive arithmetic coding for sources with large alphabets

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