Tree encoding of memoryless time-discrete sources with a fidelity criterion
From MaRDI portal
Publication:5568917
DOI10.1109/TIT.1969.1054355zbMath0176.49502WikidataQ29037905 ScholiaQ29037905MaRDI QIDQ5568917
Publication date: 1969
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (2)
Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases ⋮ A survey of constructive coding theory, and a table of binary codes of highest known rate
This page was built for publication: Tree encoding of memoryless time-discrete sources with a fidelity criterion