DocumentCode :
1051451
Title :
Improving the Alphabet-Size in Expander-Based Code Constructions
Author :
Rom, Eran ; Ta-Shma, Amnon
Volume :
52
Issue :
8
fYear :
2006
Firstpage :
3695
Lastpage :
3700
Abstract :
Various code constructions use expander graphs to improve the error resilience. Often the use of expanding graphs comes at the expense of the alphabet size. In this correspondence, we show that by replacing the balanced expanding graphs used in the above constructions with unbalanced dispersers the alphabet size can be dramatically improved
Keywords :
encoding; graph theory; code construction; expander graph; Computer science; Decoding; Error analysis; Error correction codes; Galois fields; Graph theory; Linear code; Read only memory; Reed-Solomon codes; Resilience; Disperser graphs; expander graphs; extractor codes; list decoding; randomness extractors;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2006.878166
Filename :
1661846
Link To Document :
بازگشت