Optimal binary one-ended codes

被引:1
|
作者
Kukorelly, Z [1 ]
机构
[1] Univ Calif San Diego, Informat Coding Lab, La Jolla, CA 92093 USA
关键词
one-ended codes; optimal codes; prefix-free codes; variable-length coding;
D O I
10.1109/TIT.2002.1013157
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Binary prefix-free codes in which all codewords end with a "1" have been introduced by Berger and Yeung. A recursive method is given here for the construction of all optimal "1"-ended codes with n codewords. It is shown that the set of codes obtained by the construction contains only optimal codes. We also compute recursively the number of essentially different optimal "1"-ended codes with n codewords and show that their number grows faster than any polynomial in n.
引用
收藏
页码:2125 / 2132
页数:8
相关论文
共 50 条