DocumentCode
1384604
Title
Bounds on the redundancy of binary alphabetical codes
Author
Nakatsu, Narao
Author_Institution
Dept. of Comput. & Inf. Sci., Aichi Univ. of Educ., Japan
Volume
37
Issue
4
fYear
1991
fDate
7/1/1991 12:00:00 AM
Firstpage
1225
Lastpage
1229
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;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.86980
Filename
86980
Link To Document