Corpus ID: 237635057

Punctured Large Distance Codes, and Many Reed-Solomon Codes, Achieve List-Decoding Capacity

  title={Punctured Large Distance Codes, and Many Reed-Solomon Codes, Achieve List-Decoding Capacity},
  author={Venkatesan Guruswami and Jonathan Mosheiff},
  journal={Electron. Colloquium Comput. Complex.},
We prove the existence of Reed-Solomon codes of any desired rate R ∈ (0, 1) that are combinatorially list-decodable up to a radius approaching 1 − R, which is the informationtheoretic limit. This is established by starting with the full-length [q, k]q Reed-Solomon code over a field Fq that is polynomially larger than the desired dimension k, and “puncturing” it by including k/R randomly chosen codeword positions. Our puncturing result is more general and applies to any code with large minimum… Expand


Every list-decodable code for high noise has abundant near-optimal rate puncturings
We show that any q-ary code with sufficiently good distance can be randomly punctured to obtain, with high probability, a code that is list decodable up to radius 1 --- 1/q --- ε with near-optimalExpand
List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate
The existence of RS codes that are listdecodable or list-recoverable beyond the Johnson radius for any rate, with a polynomial field size in the block length is shown. Expand
List-decodability with large radius for Reed-Solomon codes
This work focuses on the case where the list-decoding radius is of the form r = 1− ε for ε tending to zero, and states that there exist Reed–Solomon codes with rate Ω(ε) which are-list-decodable, meaning that any Hamming ball of radius 1 − ε contains at most O(1/ε) codewords. Expand
The Existence of Concatenated Codes List-Decodable up to the Hamming Bound
It is proven that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes achieve, with highExpand
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
A generalized Singleton bound for a given list size, and conjecture that the bound is tight for most RS codes over large enough finite fields are proved, and the first explicit construction of such RS codes are given. Expand
On the list decodability of random linear codes with large error rates
This work improves on a connection between list decodability of random linear codes and the Restricted Isometry Property from compressed sensing, and uses this connection to prove that a random linear code of rate Ω( ε2 /log3(1/ε)) achieves the list decoding properties above, with constant probability. Expand
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
This paper presents an explicit construction of error-correcting codes of rate that can be list decoded in polynomial time up to a fraction of worst-case errors, and their methods directly yield better decoding algorithms for RS codes when errors occur in phased bursts. Expand
Limits to List Decoding Reed-Solomon Codes
In this paper, we prove the following two results that expose some combinatorial limitations to list decoding Reed-Solomon codes. 1) Given n distinct elements alpha1,...,alphan from a field F, and nExpand
Improved List-Decodability of Reed-Solomon Codes via Tree Packings
A generalization of the tree packing theorem to hypergraphs is proved (and it is conjecture that an even stronger generalization holds) and it is hoped that this generalization tohypergraphs will be of independent interest. Expand
Improved decoding of Reed-Solomon and algebraic-geometry codes
An improved list decoding algorithm for decoding Reed-Solomon codes and alternant codes and algebraic-geometry codes is presented and a solution to a weighted curve-fitting problem is presented, which may be of use in soft-decision decoding algorithms for Reed- Solomon codes. Expand