OPTIMUM 1-ENDED BINARY PREFIX CODES

被引：19
|
作者：
BERGER, T [1 ]
YEUNG, RW [1 ]
机构：
[1] AT&T BELL LABS,HOLMDEL,NJ 07733
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1990年 / 36卷 / 06期
关键词：
D O I：
10.1109/18.59940
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The problem of finding a binary prefix code of minimum average codeword length for a given finite probability distribution subject to the requirement that each codeword must end with a “I” is considered. Lower and upper bounds to the performance of the optimum code are derived; the lower bound is tight for certain probability distributions. An algorithm that generates an optimum code for any given distribution is also described. © 1990 IEEE
引用
收藏
页码：1435 / 1441
页数：7
相关论文
共 50 条
12345