Fixed-rate universal lossy source coding and rates of convergence for memoryless sources

@article{Linder1995FixedrateUL,
  title={Fixed-rate universal lossy source coding and rates of convergence for memoryless sources},
  author={Tam{\'a}s Linder and G{\'a}bor Lugosi and Kenneth Zeger},
  journal={IEEE Trans. Information Theory},
  year={1995},
  volume={41},
  pages={665-676}
}
A fixed-rate universal lossy coding scheme is introduced for independent and identically distributed (i.i.d.) sources. It is shown for finite alphabet sources and arbitrary single letter distortion measures that as the sample size r~ grows the expected distortion obtained using this universal scheme converges to Shannon’s distortion rate function D(R) at a rate 0 (lognln). The scheme can he extended to universal quantization of real i.i.d sources subject to a squared error criterion. It is… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Z

Feb.
Zhang, E.-H. Yang, and V. K. Wei, “The redundancy of source coding • 1994
View 1 Excerpt

R

May
Zamir and M. Feder, “Information rates of me/post filtered dithered • 1993
View 1 Excerpt

Cambridge, UK: Cambridge Univ

Combinatorics
Press, 1989, • 1989
View 1 Excerpt

Kiirner, Information Theory: Coding Theorems for Discrete Memoryless Systems

J. I. Csiszar
vol. IT-19, • 1973

Communication of analog data from a Gaussian source

A. D. Wyner
AkadCmiai Kiad6, • 1971

Similar Papers

Loading similar papers…