FIXED-RATE UNIVERSAL CODES FOR MARKOV SOURCES

被引：22

作者：

NEUHOFF, DL

SHIELDS, PC

机构：

[1] UNIV MICHIGAN,DEPT ELECT & COMP ENGN,ANN ARBOR,MI 48109

[2] UNIV TOLEDO,DEPT MATH,TOLEDO,OH 43606

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1978年 / 24卷 / 03期

关键词：

D O I：

10.1109/TIT.1978.1055881

中图分类号：

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

学科分类号：

0812 ;

摘要：

The existence of a fixed-rate block source code whose performance for each source in a class of Markov sources is uniformly close to the distortion-rate function of that source is investigated. Such a code is called strong universal. It is found that strong universal codes of all rates exist for the class of all binary first-order Markov sources. But for a larger alphabet or for the class of all nth-order Markov sources with n > 2, there is a critical rate R* such that strong universal codes exist for rates greater than or equal to R*, but not for rates less than R*. © 1978 IEEE

引用

页码：360 / 367

页数：8

共 8 条

[1]

BARTLE RG, 1967, ELEMENTS REAL ANALYS

[2]

Berger T., 2003, WILEY ENCY TELECOMMU

[3] NONBLOCK SOURCE CODING WITH A FIDELITY CRITERION [J].