Variable-Length Lossy Source Code Using a Constrained-Random-Number Generator
Author:
Open Access
- 30 April 2015
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 61 (6) , 3574-3592
Abstract
A variable-length lossy source code is introduced with a rate-distortion pair close to the rate-distortion function. Random numbers that satisfy a condition specified by a function and its value are used to construct a stochastic encoder. The proof of the theorem is based on the balanced-coloring property of an ensemble of functions. Since an ensemble of systematic sparse matrices has this property, we can construct a tractable code for a memoryless source. Some algorithms for implementing the code are introduced and compared by simulation.Keywords
This publication has 43 references indexed in Scilit:
- Channel Coding and Lossy Source Coding Using a Generator of Constrained Random NumbersIEEE Transactions on Information Theory, 2014
- Lossy source code using a constrained random number generator2013
- Construction of strongly secure wiretap channel code based on hash property2011
- Thouless-Anderson-Palmer approach for lossy compressionPhysical Review E, 2004
- Simplistic universal codingIEEE Transactions on Information Theory, 1998
- Universal Almost Sure Data CompressionThe Annals of Probability, 1990
- Optimal encoding of discrete-time continuous-amplitude memoryless sources with finite output alphabetsIEEE Transactions on Information Theory, 1980
- Trellis Encoding of memoryless discrete-time sources with a fidelity criterionIEEE Transactions on Information Theory, 1974
- Double Exponential Formulas for Numerical IntegrationPublications of the Research Institute for Mathematical Sciences, 1973
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948