Title :
Optimal binary one-ended codes
Author :
Kukorelly, Zsolt
Author_Institution :
Inf. Coding Lab., Univ. of California, San Diego, CA, USA
fDate :
7/1/2002 12:00:00 AM
Abstract :
Binary prefix-free codes in which all codewords end with a "1" have been introduced by Berger and Yeung (1990). 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
Keywords :
binary codes; optimisation; codewords; length vectors; multiplicity vectors; optimal binary one-ended codes; polynomial; prefix-free code; recursive method; source coding; Binary codes; Information theory; Polynomials;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2002.1013157
