Universal coding algorithm for a family of context Markov sources

DOI10.1134/S0032946014030077zbMATH Open1321.94028OpenAlexW2049111279MaRDI QIDQ2263012FDOQ2263012

Authors: Yu. M. Shtar'kov 

Publication date: 17 March 2015

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

Full work available at URL: https://doi.org/10.1134/s0032946014030077

Recommendations

• Minimax noiseless universal coding for Markov sources
• Universal coding of nonstationary sources
• scientific article; zbMATH DE number 6460053
• Universal coding for discrete memoryless sources uniform with respect to output
• Universal Algorithms for Channel Decoding of Uncompressed Sources
• Multi-alphabet universal coding of memoryless sources
• A sequential algorithm for the universal coding of finite memory sources
• Universal decoding for finite-state channels
• Universal Compression of Markov and Related Sources Over Arbitrary Alphabets
• Universal codes for a class of composite sources (Corresp.)

Mathematics Subject Classification ID

Source coding (94A29)

Cites Work

• Title not available (Why is that?)
• The performance of universal encoding
• The context-tree weighting method: basic properties
• A universal finite memory source
• Multialphabet weighted universal coding of context tree sources
• Aim functions and sequential estimation of the source model for universal coding

Cited In (6)

• Title not available (Why is that?)
• Symbol-Based Modeling and Coding of Block Markov Sources
• Title not available (Why is that?)
• Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions
• Title not available (Why is that?)
• A universal finite memory source

This page was built for publication: Universal coding algorithm for a family of context Markov sources

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