DocumentCode :
1439215
Title :
Variable Length Unordered Codes
Author :
Pezza, Laura ; Tallini, Luca G. ; Bose, Bella
Author_Institution :
Dipt. Metodi e Modelli Matematici, Univ. di Roma La Sapienza, Rome, Italy
Volume :
58
Issue :
2
fYear :
2012
Firstpage :
548
Lastpage :
569
Abstract :
In an unordered code, no code word is contained in any other code word. Unordered codes are all unidirectional error detecting (AUED) codes. In the binary case, it is well known that among all systematic codes with k information bits, Berger codes are optimal unordered codes with r=[log2(k+1)] ≅ log2k check bits. This paper gives some new theory on variable length unordered codes and introduces a new class of systematic (instantaneous) unordered codes with variable length check symbols. The average redundancy of the new codes presented here is r ≅ (1/2)log2k+c, where c ∈ (1.0470,1.1332) ⊆ IR and kIN is the number of information bits. When k is large, it is shown that such redundancy is at most 0.6069 bits off the redundancy of an optimal systematic unordered code design with fixed length information symbols and variable length check symbols; and, at most 2.8075 bits off the redundancy of an optimal variable length unordered code design. The generalization is also given for the nonbinary case and it is shown that similar results hold true.
Keywords :
error detection codes; AUED codes; Berger codes; all unidirectional error detecting codes; optimal variable length unordered code design; word length 0.6069 bit; word length 2.8075 bit; Block codes; Decoding; Educational institutions; Indexes; Receivers; Redundancy; Systematics; Asymmetric errors; Berger codes; all unidirectional error detecting (AUED) codes; unidirectional errors; unordered codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2011.2173633
Filename :
6145506
Link To Document :
بازگشت