Efficient List-Decoding with Constant Alphabet and List Sizes

by   Zeyu Guo, et al.

We present an explicit and efficient algebraic construction of capacity-achieving list decodable codes with both constant alphabet and constant list sizes. More specifically, for any R ∈ (0,1) and ϵ>0, we give an algebraic construction of an infinite family of error-correcting codes of rate R, over an alphabet of size (1/ϵ)^O(1/ϵ^2), that can be list decoded from a (1-R-ϵ)-fraction of errors with list size at most exp(poly(1/ϵ)). Moreover, the codes can be encoded in time poly(1/ϵ, n), the output list is contained in a linear subspace of dimension at most poly(1/ϵ), and a basis for this subspace can be found in time poly(1/ϵ, n). Thus, both encoding and list decoding can be performed in fully polynomial-time poly(1/ϵ, n), except for pruning the subspace and outputting the final list which takes time exp(poly(1/ϵ))·poly(n). Our codes are quite natural and structured. Specifically, we use algebraic-geometric (AG) codes with evaluation points restricted to a subfield, and with the message space restricted to a (carefully chosen) linear subspace. Our main observation is that the output list of AG codes with subfield evaluation points is contained in an affine shift of the image of a block-triangular-Toeplitz (BTT) matrix, and that the list size can potentially be reduced to a constant by restricting the message space to a BTT evasive subspace, which is a large subspace that intersects the image of any BTT matrix in a constant number of points. We further show how to explicitly construct such BTT evasive subspaces, based on the explicit subspace designs of Guruswami and Kopparty (Combinatorica, 2016), and composition.



There are no comments yet.


page 1

page 2

page 3

page 4


Optimal rate list decoding over bounded alphabets using algebraic-geometric codes

We give new constructions of two classes of algebraic code families whic...

Improved decoding of Folded Reed-Solomon and Multiplicity Codes

In this work, we show new and improved error-correcting properties of fo...

List Decoding of Deletions Using Guess & Check Codes

Guess & Check (GC) codes are systematic binary codes that can correct mu...

Subspace Packings

The Grassmannian G_q(n,k) is the set of all k-dimensional subspaces of ...

Subspace Packings – Constructions and Bounds

The Grassmannian G_q(n,k) is the set of all k-dimensional subspaces of t...

Secure list decoding and its application to bit-string commitment

We propose a new concept of secure list decoding, which is related to bi...

Ideal-theoretic Explanation of Capacity-achieving Decoding

In this work, we present an abstract framework for some algebraic error-...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.