Bounds on list decoding of MDS codes

被引：22

作者：

Justesen, J ^{[1
]}

Hoholdt, T

机构：

[1] Tech Univ Denmark, Dept Telecommun, DK-2800 Lyngby, Denmark

[2] Tech Univ Denmark, Dept Math, DK-2800 Lyngby, Denmark

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2001年 / 47卷 / 04期

关键词：

list decoding; maximum-distance separable (MDS) codes;

D O I：

10.1109/18.923744

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We derive upper bounds on the number of errors that can be corrected by list decoding of maximum-distance separable (MDS) codes using small lists. We show that the performance of Reed-Solomon (RS) codes, fur certain parameter values, is limited by worst case codeword configurations, but that with randomly chosen codes over large alphabets, more errors can be corrected.

引用

页码：1604 / 1609

页数：6

共 5 条

[1] BETH T, 1985, DESIGN THEORY, P377
[2] Improved decoding of Reed-Solomon and algebraic-geometry codes
Guruswami, V
Sudan, M
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (06) : 1757 - 1767
[3] ON MDS CODES VIA CAUCHY MATRICES
ROTH, RM
LEMPEL, A
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (06) : 1314 - 1319
[4] Decoding of Reed Solomon codes beyond the error-correction bound
Sudan, M
[J]. JOURNAL OF COMPLEXITY, 1997, 13 (01) : 180 - 193
[5] Yemane M., 1967, Elementary sampling theory

← 1 →