Bibliographic Details
| Title: |
Improving the Alphabet-Size in Expander-Based Code Constructions. |
| Authors: |
Rom, Eran eranrom@post.tau.ac.il, Ta-Shma, Amnon1 arnnon@post.tau.ac.il |
| Source: |
IEEE Transactions on Information Theory. Aug2006, Vol. 52 Issue 8, p3695-3700. 6p. |
| Subjects: |
Alphabet -- Data processing, Graphic methods, Electronic data processing, Character sets (Data processing), Information storage & retrieval systems -- Code words, Information storage & retrieval systems, Information theory, Data transmission systems, Telecommunication |
| 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of IEEE Transactions on Information Theory is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |