On the redundancy of lossy source coding with abstract alphabets
From MaRDI portal
Publication:4701363
DOI10.1109/18.761253zbMath0959.94014OpenAlexW2169249327MaRDI QIDQ4701363
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.761253
Related Items (3)
Stochastic sub-additivity approach to the conditional large deviation principle ⋮ Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources ⋮ Large deviations for template matching between point processes
This page was built for publication: On the redundancy of lossy source coding with abstract alphabets