Title :
On binary alphabetical codes
Author :
Sheinwald, Dafna
Author_Institution :
IBM Sci. Center, Technion City, Haifa, Israel
Abstract :
Binary alphabetical codes, which are prefix free, fixed-to-variable binary codes for discrete memoryless sources, in which the lexicographic order of the codewords agrees with the alphabet order of the respective source letters, are studied. A necessary and sufficient condition on the sequence of codeword length of any such code is proved. A new upper bounds on the redundancy of alphabetical codes relative to the optimal prefix free, fixed-to-variables codes-the Huffman codes-is proved. An adaptation of the Ziv-Lempel algorithm making it lexicographic order preserving, without any additional redundancy, is presented.<>
Keywords :
codes; Huffman codes; Ziv-Lempel algorithm; alphabet order; binary alphabetical codes; codeword length; codewords; discrete memoryless sources; lexicographic order; necessary and sufficient condition; redundancy; source letters; upper bounds; Binary codes; Cities and towns; Decoding; Dynamic programming; Entropy; Heuristic algorithms; Length measurement; Redundancy; Sufficient conditions; Upper bound;
Conference_Titel :
Data Compression Conference, 1992. DCC '92.
Conference_Location :
Snowbird, UT, USA
Print_ISBN :
0-8186-2717-4
DOI :
10.1109/DCC.1992.227470
