On the List and Bounded Distance Decodability of Reed-Solomon Codes

No abstract is available for this paper.

• Publication year

  2007

• Venue

  SIAM journal on computing (Print)

• Publication date

  2007-04-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1137/S0097539705447335
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• PRIMES is in P

  2004cited by this paper
• On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields

  2004cited by this paper
• On some subgroups of the multiplicative group of finite rings

  2004cited by this paper
• Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes

  2002cited by this paper
• Combinatorial bounds for list decoding

  2002cited by this paper
• Limits to list decodability of linear codes

  2002cited by this paper
• List decoding of error correcting codes

  2001cited by this paper
• Coding theory: tutorial & survey

  2001cited by this paper
• Noisy Polynomial Interpolation and Noisy Chinese Remaindering

  2000cited by this paper
• Discrete Logarithms: The Past and the Future

  2000cited by this paper
• Bounds on list decoding of MDS codes

  2000influential reference
• Improved decoding of Reed-Solomon and algebraic-geometry codes

  1999cited by this paper
• Reed-Solomon Codes and Their Applications

  1999cited by this paper
• Generators and irreducible polynomials over finite fields

  1997cited by this paper
• Decoding of Reed Solomon Codes beyond the Error-Correction Bound

  1997cited by this paper
• Learning polynomials with queries: The highly noisy case

  1995influential reference
• Factoring polynomials in finite fields: An application of Lang-Weil to a problem in graph theory

  1990cited by this paper
• Diameters and eigenvalues

  1989cited by this paper
• Fast, Rigorous Factorization and Discrete Logarithm Algorithms

  1987cited by this paper
• A new upper bound for error-correcting codes

  1962cited by this paper
• List decoding for noisy channels

  1957cited by this paper

• Near-Optimal List-Recovery of Linear Code Families

  2025cites this paper
• Optimization by decoded quantum interferometry

  2024cites this paper
• Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds

  2024cites this paper
• Randomly Punctured Reed–Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields

  2024cites this paper
• Random Reed-Solomon codes achieve list-decoding capacity with linear-sized alphabets

  2023cites this paper
• Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets

  2023cites this paper
• On the error-correcting pair for MDS linear codes with even minimum distance

  2023cites this paper
• Improved Error Bounds for the Distance Distribution of Reed-Solomon Codes

  2022cites this paper
• Generic Reed-Solomon Codes Achieve List-Decoding Capacity

  2022cites this paper
• Improved List-Decodability of Reed-Solomon Codes via Tree Packings

  2020cites this paper
• Distance Distribution in Reed-Solomon Codes

  2020cites this paper
• Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings

  2020influential citation
• Number of distinct coordinate solutions to linear equations over finite fields

  2019cites this paper
• Distinct coordinate solutions of linear equations over finite fields

  2019cites this paper
• Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius

  2019cites this paper
• A new sieve for restricted multiset counting

  2019cites this paper
• Hardness of Decoding Random Linear Codes in the Exponent Luke Demarest

  2019cites this paper
• Distance Distribution to Received Words in Reed-Solomon Codes

  2018cites this paper
• Analysis of Bounded Distance Decoding for Reed Solomon Codes

  2018cites this paper
• The k-subset sum problem over finite fields

  2018cites this paper
• Handling Correlated Errors: Hardness of LWE in the Exponent

  2018cites this paper
• Constructions of cyclic quaternary constant-weight codes of weight three and distance four

  2018cites this paper
• On deep-holes of Gabidulin codes

  2017cites this paper
• Subset sums of quadratic residues over finite fields

  2017cites this paper
• Explicit Deep Holes of Reed-Solomon Codes

  2017cites this paper
• Constructions of cyclic quaternary constant-weight codes of weight three and distance four

  2017cites this paper
• On the error distance of extended Reed-Solomon codes

  2016influential citation
• NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem

  2016cites this paper
• On deep holes of projective Reed-Solomon codes

  2016cites this paper
• Reed-Solomon Codes and the Deep Hole Problem

  2015cites this paper
• On error distance of received words with fixed degrees to Reed-Solomon code

  2015cites this paper
• Deep holes in Reed-Solomon codes based on Dickson polynomials

  2015cites this paper
• Any Errors in this Dissertation are Probably Fixable: Topics in Probability and Error Correcting Codes.

  2014influential citation
• 基于六阶分圆序列的循环码的构造 A Construction of Cyclic Code from Cyclotomic Sequence of Order Six

  2014cites this paper
• A Construction of Cyclic Code from Cyclotomic Sequence of Order Six

  2014cites this paper
• On Determining Deep Holes of Generalized Reed–Solomon Codes

  2013cites this paper
• An Asymptotic Formula For Counting Subset Sums Over Subgroups Of Finite Fields

  2013cites this paper
• Every list-decodable code for high noise has abundant near-optimal rate puncturings

  2013cites this paper
• Generalised Jacobians in Cryptography and Coding Theory

  2012cites this paper
• New Deep Holes of Generalized Reed-Solomon Codes

  2012cites this paper
• Computing Error Distance of Reed-Solomon Codes

  2012influential citation
• On the number field sieve: polynomial selection and smooth elements in number fields

  2012cites this paper
• Cyclic codes from cyclotomic sequences of order four

  2012cites this paper
• Discrete logarithm computations over finite fields using Reed-Solomon codes

  2012influential citation
• On Reed-Solomon codes

  2011cites this paper
• A new sieve for distinct coordinate counting

  2010cites this paper
• An asymptotic formula for counting subset sums over subgroups of finite fields

  2010cites this paper
• Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes

  2010influential citation
• Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes

  2010cites this paper
• Improvements on the Johnson bound for Reed-Solomon codes

  2009cites this paper
• A Deterministic Reduction for the Gap Minimum Distance Problem

  2009cites this paper
• Complexity of Decoding Positive-Rate Reed-Solomon Codes

  2008cites this paper
• On error distance of Reed-Solomon codes

  2008cites this paper
• List decoding and property testing of error-correcting codes

  2007influential citation
• On the subset sum problem over finite fields

  2007cites this paper
• Parameter choices on Guruswami--Sudan algorithm for polynomial reconstruction

  2007influential citation
• On Error Correction in the Exponent

  2006cites this paper
• Subspace Polynomials and List Decoding of Reed-Solomon Codes

  2006cites this paper
• Limits to List Decoding Reed–Solomon Codes

  2005cites this paper