Nonasymptotic noisy lossy source coding

R. Dobrushin and B. Tsybakov, “Information transmission with additional noise,” IRE Transactions on Information Theory , vol. 8, no. 5, pp. 293 –304, Sep. 1962

1962

Earlier work this paper cites.

D. Sakrison, “Source encoding in the presence of random disturbance,” IEEE Transactions on Information Theory , vol. 14, no. 1, pp. 165–167, Jan. 1968

1968

Earlier work this paper cites.

J. Wolf and J. Ziv, “Transmission of noisy information to a noisy receiver with minimum distortion,” IEEE Transactions on Information Theory , vol. 16, no. 4, pp. 406–411, July 1970

1970

Earlier work this paper cites.

T. Berger, Rate distortion theory . Prentice-Hall, Englewood Cliffs, NJ, 1971

1971

Earlier work this paper cites.

W. Feller, An Introduction to Probability Theory and its Applications , 2nd ed. John Wiley & Sons, 1971, vol. II

1971

Earlier work this paper cites.

I. Csiszár, “On an extremum problem of information theory,” Studia Scientiarum Mathematicarum Hungarica , vol. 9, no. 1, pp. 57–71, Jan. 1974

1974

Earlier work this paper cites.

H. S. Witsenhausen, “Indirect rate distortion problems,” IEEE Transactions on Information Theory , vol. 26, no. 5, pp. 518–521, Sep. 1980

1980

Earlier work this paper cites.

Y. Ephraim and R. M. Gray, “A unified approach for encoding clean and noisy sources by means of waveform and autoregressive model vector quantization,” IEEE Transactions on Information Theory , vol. 34, no. 4, pp. 826–834, Sep. 1988

1988

Earlier work this paper cites.

E. Ayanoğlu, “On optimal quantization of noisy sources,” IEEE Transactions on Information Theory , vol. 36, no. 6, pp. 1450–1452, Nov. 1990

1990

Earlier work this paper cites.

T. Fischer, J. Gibson, and B. Koo, “Estimation and noisy source coding,” IEEE Transactions on Acoustics, Speech and Signal Processing , vol. 38, no. 1, pp. 23–34, Jan. 1990

1990

Cited alongside, same era.

B. Yu and T. Speed, “A rate of convergence result for a universal d d -semifaithful code,” IEEE Transactions on Information Theory , vol. 39, no. 3, pp. 813–820, May 1993

1993

Cited alongside, same era.

E. Yang and Z. Zhang, “On the redundancy of lossy source coding with abstract alphabets,” IEEE Transactions on Information Theory , vol. 45, no. 4, pp. 1092–1110, May 1999

1999

Cited alongside, same era.

N. Tishby, F. C. Pereira, and W. Bialek, “The information bottleneck method,” in Proceedings 37-th Annual Allerton Conference on Communication, Control and Computing , Monticello, IL, Oct. 2000, pp. 368–377

2000

Cited alongside, same era.

A. Ingber and Y. Kochman, “The dispersion of lossy source coding,” in Data Compression Conference (DCC) , Snowbird, UT, Mar. 2011, pp. 53–62

2011

Later among the works it cites.

——, “On the absolute constants in the Berry-Esseén type inequalities for identically distributed summands,” arXiv preprint arXiv:1111.6554 , 2011

Original

2011

Later among the works it cites.

V. Kostina and S. Verdú, “Fixed-length lossy compression in the finite blocklength regime,” IEEE Transactions on Information Theory , vol. 58, no. 6, pp. 3309–3338, June 2012

2012

Later among the works it cites.

S. Verdú, “Non-asymptotic achievability bounds in multiuser information theory,” in Proceedings 50th Annual Allerton Conference on Communication, Control, and Computing , Monticello, IL, Oct. 2012, pp. 1–8

2012

Later among the works it cites.