pith. sign in

arxiv: 1008.2008 · v2 · pith:Z3QPDT3Bnew · submitted 2010-08-11 · 💻 cs.IT · math.IT

Rate-Constrained Simulation and Source Coding IID Sources

classification 💻 cs.IT math.IT
keywords codingmethodsrate-constrainedsimulationsourcesourcesalphabet-constrainedapproach
0
0 comments X
read the original abstract

Necessary conditions for asymptotically optimal sliding-block or stationary codes for source coding and rate-constrained simulation of memoryless sources are presented and used to motivate a design technique for trellis-encoded source coding and rate-constrained simulation. The code structure has intuitive similarities to classic random coding arguments as well as to ``fake process'' methods and alphabet-constrained methods. Experimental evidence shows that the approach provides comparable or superior performance in comparison with previously published methods on common examples, sometimes by significant margins.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.