On variable length coding with side information for discrete memoryless sources

DOI10.1007/BF02008366MaRDI QIDQ1101411zbMATH OpenOpenAlexFDO

Authors Ning Cai, Zhaozhi Zhang

Publication date 1987

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02008366

zbMATH Keywords

discrete memoryless sourcesminimum achievable rateside information at the decoderzero error variable length coding

Mathematics Subject Classification ID

Source coding (94A29) Prefix, length-variable, comma-free codes (94A45)

Review text

In this paper we consider the zero error variable length coding problem for discrete memoryless sources with side information at the decoder only. Using concepts of graph theory, we obtain a characterization of the minimum achievable rate r for this coding problem. Furthermore, computable upper and lower bounds for the minimum achievable rate r is given and a condition under which the upper and lower bounds are equal is found. Finally, this result is applied to some examples in which the minimum achievable rate r can be evaluated.

Recommendations

• On zero-error source coding with decoder side information
• \(\epsilon\)-optimal coding rates of a randomly varying source with side information at the decoder
• On source coding with side-information-dependent distortion measures
• On zero-error coding of correlated sources
• Source coding for average rate and average distortion: New variable-length coding theorems

Cites work

• scientific article; zbMATH DE number 3316587 (Why is no real title available?)
• scientific article; zbMATH DE number 3062467 (Why is no real title available?)
• The zero-error side information problem and chromatic numbers (Corresp.)

Cited in

(6)

• Fixed-rate encoding of individual sequences with side information
• Zero-Error Source–Channel Coding With Side Information
• On zero-error source coding with decoder side information
• Lower bounds on the code rate for a model of data transmission with side information
• Ning Cai: a tribute to a pioneering scholar in information theory
• \(\epsilon\)-optimal coding rates of a randomly varying source with side information at the decoder

This page was built for publication: On variable length coding with side information for discrete memoryless sources

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