About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Conference paper
On binary alphabetical codes
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 lengths of any such code is proved. A new upper bounds on the redundancy of alphabetical codes relative to the optimal prefix free, fixed-to-variable codes - the Huffman codes - is proved. An adaptation of the Ziv-Lempel algorithm making it lexicographic order preserving, without any additional redundancy, is presented.