Title :
Bounds on the redundancy of binary alphabetical codes
Author_Institution :
Dept. of Comput. & Inf. Sci., Aichi Univ. of Educ., Japan
fDate :
7/1/1991 12:00:00 AM
Abstract :
An alphabetical code is a code in which the numerical binary order of the codewords corresponds to the alphabetical order of the encoded symbols. A necessary and sufficient condition for the existence of a binary alphabetical code is presented. The redundancy of the optimum binary alphabetical code is given in comparison with the Huffman code and its upper bound, which is tighter than bounds previously reported, is presented. The redundancy of the optimal alphabetical code is about 5% in comparison with the Huffman coding, which shows the usefulness of the alphabetical code
Keywords :
codes; data compression; redundancy; binary alphabetical codes; data compression; optimal alphabetical code; redundancy; upper bound; Computer displays; Data compression; Decoding; Distributed computing; Error correction codes; Information retrieval; Notice of Violation; Redundancy; Sufficient conditions; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
