DocumentCode
940421
Title
A unique ranking of multilevel sequences and its application to source coding (Corresp.)
Author
Tanaka, Hatsukazu ; Ando, Minoru ; Leon-Garcia, Alberto
Volume
31
Issue
4
fYear
1985
fDate
7/1/1985 12:00:00 AM
Firstpage
530
Lastpage
537
Abstract
A new simple algorithm for unique ranking of
-ary sequences is presented, using a general triangle (a triangular array of integers) that includes the well-known Pascal triangle as a special case. Applying the algorithm gives a new multilevel source coding scheme for which the prefix is the Lee weight and the suffix is the ranking number. A detailed analysis of the asymptotic performance shows that the new scheme is weighted universal. The inverse enumeration algorithm for decoding is also presented, and the complexity of the algorithm increases linearly in proportion to the length of source sequences.
-ary sequences is presented, using a general triangle (a triangular array of integers) that includes the well-known Pascal triangle as a special case. Applying the algorithm gives a new multilevel source coding scheme for which the prefix is the Lee weight and the suffix is the ranking number. A detailed analysis of the asymptotic performance shows that the new scheme is weighted universal. The inverse enumeration algorithm for decoding is also presented, and the complexity of the algorithm increases linearly in proportion to the length of source sequences.Keywords
Sequences; Source coding; Concatenated codes; Councils; Decoding; Information theory; Minimax techniques; Performance analysis; Source coding;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1985.1057064
Filename
1057064
Link To Document