Source matching problems revisited

DOI10.1109/18.144723zbMATH Open0775.94083OpenAlexW2024577695MaRDI QIDQ4014160FDOQ4014160

Authors: Laurence B. Wolfe, Chein-I Chang 

Publication date: 11 October 1992

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7c31abfe5777277c39c420d9250c7f36d792ced2

Recommendations

• A source matching approach to finding minimax codes
• On the source matching approach for Markov sources (Corresp.)
• Minimax noiseless universal coding for Markov sources
• scientific article; zbMATH DE number 1285526
• Minimax redundancy for the class of memoryless sources

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40) Rate-distortion theory in information and communication theory (94A34)

Cited In (4)

• A source matching approach to finding minimax codes
• A complete sufficient statistic for finite-state Markov processes with application to source coding
• Statistical matching of multiple sources: A look through coherence
• On the source matching approach for Markov sources (Corresp.)

This page was built for publication: Source matching problems revisited

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