Improving the alphabet-size in expander-based code constructions

Eran Rom; Amnon Ta-Shma

doi:10.1109/TIT.2006.878166

Improving the alphabet-size in expander-based code constructions

Eran Rom^*, Amnon Ta-Shma

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

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.

Original language	English
Pages (from-to)	3695-3700
Number of pages	6
Journal	IEEE Transactions on Information Theory
Volume	52
Issue number	8
DOIs	https://doi.org/10.1109/TIT.2006.878166
State	Published - Aug 2006

Keywords

Disperser graphs
Expander graphs
Extractor codes
List decoding
Randomness extractors

Access to Document

10.1109/TIT.2006.878166

Cite this

@article{4bbcaa5e0e27412481b9d270aa4be39c,

title = "Improving the alphabet-size in expander-based code constructions",

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 = "Disperser graphs, Expander graphs, Extractor codes, List decoding, Randomness extractors",

author = "Eran Rom and Amnon Ta-Shma",

year = "2006",

month = aug,

doi = "10.1109/TIT.2006.878166",

language = "אנגלית",

volume = "52",

pages = "3695--3700",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "8",

}

TY - JOUR

T1 - Improving the alphabet-size in expander-based code constructions

AU - Rom, Eran

AU - Ta-Shma, Amnon

PY - 2006/8

Y1 - 2006/8

N2 - 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.

AB - 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.

KW - Disperser graphs

KW - Expander graphs

KW - Extractor codes

KW - List decoding

KW - Randomness extractors

UR - https://www.scopus.com/pages/publications/33746657676

U2 - 10.1109/TIT.2006.878166

DO - 10.1109/TIT.2006.878166

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:33746657676

SN - 0018-9448

VL - 52

SP - 3695

EP - 3700

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 8

ER -

Improving the alphabet-size in expander-based code constructions

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this