DocumentCode
169305
Title
Variable-length lossy source code using a constrained-random-number generator
Author
Muramatsu, J.
Author_Institution
NTT Commun. Sci. Labs., NTT Corp., Japan
fYear
2014
fDate
2-5 Nov. 2014
Firstpage
197
Lastpage
201
Abstract
A variable-length lossy source code is introduced with a rate-distortion pair close to the rate-distortion function. 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 practical code for a memoryless source by using the sum-product algorithm.
Keywords
memoryless systems; random number generation; rate distortion theory; source coding; sparse matrices; variable length codes; balanced-coloring property; constrained-random number generator; memoryless source; rate distortion function; sum-product algorithm; systematic sparse matrix ensemble; variable length lossy source code; Encoding; Generators; Probability distribution; Rate-distortion; Sparse matrices; Sum product algorithm; Systematics;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop (ITW), 2014 IEEE
Conference_Location
Hobart, TAS
ISSN
1662-9019
Type
conf
DOI
10.1109/ITW.2014.6970820
Filename
6970820
Link To Document