论文信息 - A note on the abstract alphabet block source coding with a fidelity criterion theorem (Corresp.)

A note on the abstract alphabet block source coding with a fidelity criterion theorem (Corresp.)

Berger's proof of the abstract-alphabet block source coding with a fidelity criterion theorem is shown to be incomplete due to an error by Perez in extending the Shannon-McMillan Theorem to general stationary sources. A result of Pinsker is used to simply and directly complete the proof of the theorem.

James George Dunham

[1] J. Kieffer. A Counterexample to Perez's Generalization of the Shannon-McMillan Theorem , 1973 .

[2] A. Tulcea. Contributions to information theory for abstract alphabets , 1961 .

[3] Shu-Teh Chen Moy,et al. Asymptotic properties of derivatives of stationary measures , 1960 .

[4] J. Kieffer. A SIMPLE PROOF OF THE MOY-PEREZ GENERALIZATION OF THE SHANNON-MCMILLAN THEOREM , 1974 .

[5] Toby Berger,et al. Rate distortion theory : a mathematical basis for data compression , 1971 .

[6] John C. Kieffer,et al. Note: Correction to "A Counterexample to Perez's Generalization of the Shannon-McMillan Theorem" , 1976 .

[7] Shu-Teh Chen Moy,et al. Generalizations of Shannon-McMillan theorem , 1961 .