Sample converses in source coding theory
From MaRDI portal
Publication:5753870
DOI10.1109/18.75241zbMath0721.94004OpenAlexW2014246307MaRDI QIDQ5753870
Publication date: 1991
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.75241
Related Items (2)
Algorithmic complexity of points in dynamical systems ⋮ Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields
This page was built for publication: Sample converses in source coding theory