In this work, we present an abstract framework for some algebraic error-correcting codes with the aim of capturing codes that are list-decodable to capacity, along with their decoding algorithm. In the polynomial ideal framework, a code is specified by some ideals in a polynomial ring, messages are polynomials and their encoding is the residue modulo the ideals. We present an alternate way of viewing this class of codes in terms of linear operators, and show that this alternate view makes their algorithmic list-decodability amenable to analysis. Our framework leads to a new class of codes that we call affine Folded Reed-Solomon codes (which are themselves a special case of the broader class we explore). These codes are common generalizations of the well-studied Folded Reed-Solomon codes and Multiplicity codes, while also capturing the less-studied Additive Folded Reed-Solomon codes as well as a large family of codes that were not previously known/studied. More significantly our framework also captures the algorithmic list-decodability of the constituent codes. Specifically, we present a unified view of the decoding algorithm for idealtheoretic codes and show that the decodability reduces to the analysis of the distance of some related codes. We show that good bounds on this distance lead to capacity-achieving performance of the underlying code, providing a unifying explanation of known capacity-achieving results. In the specific case of affine Folded Reed-Solomon codes, our framework shows that they are list-decodable up to capacity (for appropriate setting of the parameters), thereby unifying the previous results for Folded Reed-Solomon, Multiplicity and Additive Folded ReedSolomon codes.
[1]
Venkatesan Guruswami,et al.
Improved decoding of Reed-Solomon and algebraic-geometry codes
,
1999,
IEEE Trans. Inf. Theory.
[2]
L. Babai,et al.
Theory of Computing
,
2015
.
[3]
Shubhangi Saraf,et al.
High-rate codes with sublinear-time decoding
,
2014,
Electron. Colloquium Comput. Complex..
[4]
Swastik Kopparty.
List-Decoding Multiplicity Codes
,
2012,
Theory Comput..
[5]
Lidia Arroyo Prieto.
Acm
,
2020,
Encyclopedia of Cryptography and Security.
[6]
Venkatesan Guruswami,et al.
"Soft-decision" decoding of Chinese remainder codes
,
2000,
Proceedings 41st Annual Symposium on Foundations of Computer Science.
[7]
Venkatesan Guruswami,et al.
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
,
2005,
IEEE Transactions on Information Theory.
[8]
Venkatesan Guruswami,et al.
Linear-Algebraic List Decoding of Folded Reed-Solomon Codes
,
2011,
2011 IEEE 26th Annual Conference on Computational Complexity.
[9]
Erich Kaltofen,et al.
Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
,
1985,
SIAM J. Comput..
[10]
Venkatesan Guruswami,et al.
Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
,
2013,
IEEE Transactions on Information Theory.