z-logo
open-access-imgOpen Access
Variable-Length Lossy Source Code Using a Constrained-Random-Number Generator
Author(s) -
Jun Muramatsu
Publication year - 2015
Publication title -
ieee transactions on information theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.218
H-Index - 286
eISSN - 1557-9654
pISSN - 0018-9448
DOI - 10.1109/tit.2015.2428238
Subject(s) - communication, networking and broadcast technologies , signal processing and analysis
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom