The source coding theorem revisited: A combinatorial approach

DOI10.1109/TIT.1979.1056081MaRDI QIDQ3855093zbMATH OpenFDO

Authors Giuseppe Longo, Andrea Sgarro

Publication date 1979

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

Full work available at URL https://doi.org/10.1109/TIT.1979.1056081

zbMATH Keywords

composition classdivergenceentropyfinite memoryless stationary sourceprobability of error

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Cited in

(2)

• Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields
• Bounds on Data Compression Ratio with a Given Tolerable Error Probability

This page was built for publication: The source coding theorem revisited: A combinatorial approach

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