scientific article; zbMATH DE number 1424178

zbMATH Open0981.94005MaRDI QIDQ4945375FDOQ4945375

Authors: Andrei Fionov, B. Ya. Ryabko 

Publication date: 18 March 2002

Title of this publication is not available (Why is that?)

Recommendations

• Efficient method of adaptive arithmetic coding for sources with large alphabets
• Linear time adaptive arithmetic coding
• Fast arithmetic coding algorithm of data compression
• Fast and efficient coding of information sources
• Fast adaptive coding algorithm

zbMATH Keywords

source codingadaptive arithmetic codeimaginary sliding window

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (15)

• Finite-precision arithmetic coding via index-splitting and probability-fitting
• On-line adaptive canonical prefix coding with bounded compression loss
• Linear time adaptive arithmetic coding
• Arithmetic coding with dual symbol sets and its performance analysis
• Title not available (Why is that?)
• A fast algorithm for adaptive prefix coding
• Fast codes for large alphabets
• Arithmetic coding with folds and unfolds
• Dynamic pipeline design of an adaptive binary arithmetic coder
• A fast and efficient nearly-optimal adaptive Fano coding scheme
• Adaptive arithmetic coding using fuzzy reasoning and grey prediction
• A rapid probability estimator and binary arithmetic coder
• Efficient method of adaptive arithmetic coding for sources with large alphabets
• Fast arithmetic coding algorithm of data compression
• \(p\)-adic arithmetic coding

This page was built for publication:

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