Improving the Alphabet-Size in Expander-Based Code Constructions.
Saved in:
| 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 |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 21833934 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Improving the Alphabet-Size in Expander-Based Code Constructions. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Rom%2C+Eran%22">Rom, Eran</searchLink><i> eranrom@post.tau.ac.il</i><br /><searchLink fieldCode="AR" term="%22Ta-Shma%2C+Amnon%22">Ta-Shma, Amnon</searchLink><relatesTo>1</relatesTo><i> arnnon@post.tau.ac.il</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22IEEE+Transactions+on+Information+Theory%22">IEEE Transactions on Information Theory</searchLink>. Aug2006, Vol. 52 Issue 8, p3695-3700. 6p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Alphabet+--+Data+processing%22">Alphabet -- Data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Graphic+methods%22">Graphic methods</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+data+processing%22">Electronic data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Character+sets+%28Data+processing%29%22">Character sets (Data processing)</searchLink><br /><searchLink fieldCode="DE" term="%22Information+storage+%26+retrieval+systems+--+Code+words%22">Information storage & retrieval systems -- Code words</searchLink><br /><searchLink fieldCode="DE" term="%22Information+storage+%26+retrieval+systems%22">Information storage & retrieval systems</searchLink><br /><searchLink fieldCode="DE" term="%22Information+theory%22">Information theory</searchLink><br /><searchLink fieldCode="DE" term="%22Data+transmission+systems%22">Data transmission systems</searchLink><br /><searchLink fieldCode="DE" term="%22Telecommunication%22">Telecommunication</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=21833934 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1109/TIT.2006.878166 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 6 StartPage: 3695 Subjects: – SubjectFull: Alphabet -- Data processing Type: general – SubjectFull: Graphic methods Type: general – SubjectFull: Electronic data processing Type: general – SubjectFull: Character sets (Data processing) Type: general – SubjectFull: Information storage & retrieval systems -- Code words Type: general – SubjectFull: Information storage & retrieval systems Type: general – SubjectFull: Information theory Type: general – SubjectFull: Data transmission systems Type: general – SubjectFull: Telecommunication Type: general Titles: – TitleFull: Improving the Alphabet-Size in Expander-Based Code Constructions. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Rom, Eran – PersonEntity: Name: NameFull: Ta-Shma, Amnon IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 08 Text: Aug2006 Type: published Y: 2006 Identifiers: – Type: issn-print Value: 00189448 Numbering: – Type: volume Value: 52 – Type: issue Value: 8 Titles: – TitleFull: IEEE Transactions on Information Theory Type: main |
| ResultId | 1 |
