SAMPLE CONVERSES IN SOURCE-CODING THEORY

被引：50

作者：

KIEFFER, JC

机构：

[1] Department of Electrical Engineering, University of Minnesota, Minneapolis, MN, 55455

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1991年 / 37卷 / 02期

基金：

美国国家科学基金会;

关键词：

BLOCK AND VARIABLE-RATE SOURCE CODING; SAMPLE PERFORMANCE OF CODES;

D O I：

10.1109/18.75241

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A study is made of the rate and distortion performance of a sequence of codes along a sample sequence of symbols generated by a stationary ergodic information source. Two results are obtained: 1) The source sample sequence is encoded by an arbitrary sequence of block codes which operate at a fixed rate level R, and a sample converse is obtained which states that, with probability one, the lower limit of the code sample distortions is lower bounded by D(R), the value of the distortion rate function at R; 2) the source sample sequence is encoded by an arbitrary sequence of variable-rate codes which operate at a fixed distortion level D, and a sample converse is obtained which states that, with probability one, the lower limit of the code sample rates is lower bounded by R(D), the value of the rate distortion function at D. A powerful new ergodic theorem is used to obtain both sample converses.

引用

页码：263 / 268

页数：6

共 12 条

[1] A SANDWICH PROOF OF THE SHANNON-MCMILLAN-BREIMAN THEOREM [J].