The source coding theorem revisited: A combinatorial approach
From MaRDI portal
Publication:3855093
DOI10.1109/TIT.1979.1056081zbMath0421.94005MaRDI QIDQ3855093
Publication date: 1979
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (2)
Bounds on Data Compression Ratio with a Given Tolerable Error Probability ⋮ Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields
This page was built for publication: The source coding theorem revisited: A combinatorial approach