Title :
The number of optimal binary one-ended codes
Author :
Kukorelly, Zsolt
Author_Institution :
Inf. Coding Lab., California Univ., San Diego, La Jolla, CA, USA
Abstract :
Binary prefix-free codes in which all codewords end with “1” are considered. A recursion is given to construct all “optimal” 1-ended codes and to compute the number of such codes with n codewords
Keywords :
binary codes; optimisation; source coding; binary prefix-free codes; optimal binary one-ended codes; recursion method; source coding; Binary codes; Information processing; Laboratories; Probability distribution;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866304
