On the Error-Correcting Radius of Folded Reed-Solomon Code Designs

被引：1

作者：

Brauchle, Joschi ^{[1
]}

机构：

[1] Tech Univ Munich, Inst Commun Engn, Munich, Germany

来源：

CODING THEORY AND APPLICATIONS, 4TH INTERNATIONAL CASTLE MEETING | 2015年 / 3卷

关键词：

Decoding radius; Low-order folded Reed-Solomon Codes; Multivariate interpolation; Parvaresh-Vardy codes;

D O I：

10.1007/978-3-319-17296-5_7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A general formula for the error-correcting radius of linear-algebraic multivariate interpolation decoding of folded Reed-Solomon (FRS) codes is derived. Based on this result, an improved construction of FRS codes is motivated, which can be obtained by puncturing Parvaresh-Vardy codes. The proposed codes allow decoding for all rates, remove the structural loss in decoding radius of the original FRS design and maximize the fraction of correctable errors.

引用

页码：77 / 86

页数：10

共 11 条

[1] HIGHLY RESILIENT CORRECTORS FOR POLYNOMIALS
GEMMELL, P
SUDAN, M
[J]. INFORMATION PROCESSING LETTERS, 1992, 43 (04) : 169 - 174
[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] Guruswami V., 2013, ABS13117084 CORR
[4] Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy
Guruswami, Venkatesan
Rudra, Atri
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (01) : 135 - 150
[5] Linear-Algebraic List Decoding for Variants of Reed-Solomon Codes
Guruswami, Venkatesan
Wang, Carol
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (06) : 3257 - 3268
[6] Justesen J., 2004, EUR MATH SOC ZURICH, DOI [10.4171/001, DOI 10.4171/001]
[7] Lang S., 2002, GRADUATE TEXTS MATH, V211
[8] Correcting errors beyond the Guruswami-Sudan radius in polynomial time
Parvaresh, F
Vardy, A
[J]. 46TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2005, : 285 - 294
[9] Decoding of Reed Solomon codes beyond the error-correction bound
Sudan, M
[J]. JOURNAL OF COMPLEXITY, 1997, 13 (01) : 180 - 193
[10] Pseudorandomness
Vadhan, Salil P.
[J]. FOUNDATIONS AND TRENDS IN THEORETICAL COMPUTER SCIENCE, 2011, 7 (1-3): : 1 - 336

← 1 2 →