Improved decoding of Reed-Solomon and algebraic-geometry codes

No abstract is available for this paper.

• Publication year

  1999

• Venue

  IEEE Transactions on Information Theory

• Publication date

  1999-09-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/18.782097
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Bounds on list decoding of MDS codes

  2000cited by this paper
• Computing Roots of Polynomials over Function Fields of Curves

  1999influential reference
• A displacement approach to efficient decoding of algebraic-geometric codes

  1999cited by this paper
• Decoding algebraic-geometric codes beyond the error-correction bound

  1998influential reference
• Algebraic-Geometry Codes

  1998cited by this paper
• Efficient decoding of Reed-Solomon codes beyond half the minimum distance

  1998cited by this paper
• Algorithmic complexity in coding theory and the minimum distance problem

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

  1997influential reference
• Decoding Reed Solomon Codes beyond the Error-Correction Diameter

  1997cited by this paper
• Polynomial Factorization

  1996cited by this paper
• Bounded distance+1 soft-decision Reed-Solomon decoding

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

  1995cited by this paper
• Algebraic function fields and codes

  1993cited by this paper
• A course in computational algebraic number theory

  1993cited by this paper
• Reconstructing algebraic functions from mixed data

  1992cited by this paper
• Highly Resilient Correctors for Polynomials

  1992cited by this paper
• Polynomial Factorization 1987-1991

  1992cited by this paper
• A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes

  1991cited by this paper
• Error-correcting codes for list decoding

  1991cited by this paper
• A personal communication

  1989cited by this paper
• Theory and practice of error control codes

  1986cited by this paper
• Factorization of polynomials over a finite field and the solution of systems of algebraic equations

  1986cited by this paper
• Algebraic coding theory

  1984cited by this paper
• Introduction to Coding Theory

  1982cited by this paper
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound

  1982cited by this paper
• A polynomial-time reduction from bivariate to univariate integral polynomial factorization

  1982cited by this paper
• Generalized minimum distance decoding

  1966cited by this paper
• Encoding and error-correction procedures for the Bose-Chaudhuri codes

  1960influential reference
• List decoding for noisy channels

  1957cited by this paper
• January

  1890cited by this paper
• Theory of Error-correcting Codes

  year unknowncited by this paper

• Recovering polynomials over finite fields from noisy character values

  2026cites this paper
• Reconstructing Reed-Solomon Codes from Multiple Noisy Channel Outputs

  2026cites this paper
• Successive Cancellation List Decoding of Extended Reed-Solomon Codes

  2026cites this paper
• Counting polynomials with distinct zeros in Galois ring GR(p2,r)

  2025cites this paper
• List Decoding Reed-Solomon Codes in the Lee, Euclidean, and Other Metrics

  2025influential citation
• On the deep holes of a class of Cauchy codes

  2025cites this paper
• Explicit Subcodes of Reed-Solomon Codes That Efficiently Achieve List Decoding Capacity

  2025cites this paper
• Phalanx: An FHE-Friendly SNARK for Verifiable Computation on Encrypted Data

  2025cites this paper
• On Solving Sparse Polynomial Factorization Related Problems

  2025cites this paper
• Explicit Codes Approaching Generalized Singleton Bound using Expanders

  2025cites this paper
• Low-Complexity Chase Decoding of Elliptic Codes

  2025cites this paper
• Model-Preserving MPC with Low Communication Based on Multivariate Nonlinear Problems

  2025cites this paper
• Kernelized Decoded Quantum Interferometry

  2025influential citation
• List Coset Decoding of Linear Block Codes: Divide and Conquer

  2025cites this paper
• AI-Driven Blockchain and Federated Learning for Secure Electronic Health Records Sharing

  2025cites this paper
• Algebraic Chase Decoding of Elliptic Codes With Generalized Re-Encoding Transform and Improved Root-Finding

  2025cites this paper
• On decoding hyperbolic codes

  2025cites this paper
• Deterministic list decoding of Reed-Solomon codes

  2025influential citation
• On Proximity Gaps for Reed-Solomon Codes

  2025influential citation
• Deterministic factorization of constant-depth algebraic circuits in subexponential time

  2025cites this paper
• FHE-SNARK vs. SNARK-FHE: From Analysis to Practical Verifiable Computation

  2025cites this paper
• Near-Optimal List-Recovery of Linear Code Families

  2025cites this paper
• Derandomization via Symmetric Polytopes: Poly-time Factorization of Certain Sparse Polynomials

  2025cites this paper
• A Two-Stage Soft-Decision Decoding Algorithm for BCH Codes

  2025cites this paper
• A Co-Design of Lossy Compression and Error Correction for Approximate Communication

  2025cites this paper
• Time and Space Efficient Deterministic List Decoding

  2025cites this paper
• Systematic Bernoulli Generator Matrix Codes

  2025cites this paper
• SCL Decoding of Non-Binary Linear Block Codes

  2025cites this paper
• Fast list recovery of univariate multiplicity and folded Reed-Solomon codes

  2025influential citation
• A Fast Decoding Algorithm for Generalized Reed-Solomon Codes and Alternant Codes

  2025cites this paper
• One-Step Ahead Decoding for Symmetric Block-Wise Concatenated BCH Codes

  2025cites this paper
• List decoding of evaluation codes

  2025cites this paper
• PRIVocular: Enhancing User Privacy Through Air-Gapped Communication Channels

  2025cites this paper
• An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes

  2024cites this paper
• Local Correction of Linear Functions over the Boolean Cube

  2024cites this paper
• Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric

  2024cites this paper
• BCH Based U-UV Codes and Its SCL Decoding

  2024cites this paper
• Elliptic code-based oblivious polynomial evaluation

  2024cites this paper
• Multiplicity Assignments for Koetter-Vardy Decoding. The Case of Traceability Codes

  2024cites this paper
• A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem

  2024cites this paper
• Circle STARKs

  2024cites this paper
• Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits

  2024cites this paper
• Optimally Decoding 2-D Reed–Solomon Codes Against Deletion Errors

  2024cites this paper
• Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring

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

  2024cites this paper
• Quantum Communication Advantage in TFNP

  2024cites this paper
• Single trace HQC shared key recovery with SASCA

  2024cites this paper
• Application of Module to Coding Theory: A Systematic Literature Review

  2024cites this paper
• List decoding of maximal order codes over number fields

  2024cites this paper
• Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions

  2024cites this paper
• Understanding binary-Goppa decoding

  2024cites this paper
• Low-Complexity Coding Techniques for Cloud Radio Access Networks

  2024cites this paper
• Improving Hard-Decision FEC Decoding via Four-Level Bit Marking: A Case Study of KR4/KP4 Codes

  2024cites this paper
• Efficient Root-Finding for Interpolation-Based Decoding of Elliptic and Hyperelliptic Codes

  2024cites this paper
• Shift-Sum Decoding of Non-Binary Cyclic Codes

  2024cites this paper
• QfaR: Location-Guided Scanning of Visual Codes from Long Distances

  2023cites this paper
• Bounds and Constructions of Parent Identifying Schemes via the Algorithmic Version of the Lovász Local Lemma

  2023cites this paper
• Generalized Singleton Bound and List-Decoding Reed-Solomon Codes Beyond the Johnson Radius

  2023cites this paper
• Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes

  2023cites this paper
• Fast and Low-Complexity Soft-Decision Generalized Integrated Interleaved Decoder

  2023cites this paper
• Problem-X: A Catalyst for Social Problem Solving and Digital Inclusion

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

  2023cites this paper
• Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes

  2023cites this paper
• Reducing the Keysize of McEliece Cryptosystem with Improved Patterson’s Algorithm

  2023cites this paper
• Nonbinary Zipper Codes Based on Reed-Solomon Codes

  2023cites this paper
• On the Structure of Higher Order MDS Codes

  2023cites this paper
• Quasi-linear masking against SCA and FIA, with cost amortization

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

  2023cites this paper
• Practical Coded Sharding

  2023cites this paper
• An IND-CPA Analysis of a Cryptosystem Based on Bivariate Polynomial Reconstruction Problem

  2023cites this paper
• Codes for Correcting Asymmetric Adjacent Transpositions and Deletions

  2023cites this paper
• A masking method based on orthonormal spaces, protecting several bytes against both SCA and FIA with a reduced cost

  2023cites this paper
• Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes

  2023cites this paper
• Quasi-linear masking to protect against both SCA and FIA

  2023cites this paper
• Minimal Derivative Descendants of Cyclic Codes

  2023cites this paper
• A Graph-Based Soft-Decision Decoding Scheme for Reed-Solomon Codes

  2023cites this paper
• Multi-biometrische Kryptosysteme

  2023cites this paper
• Systematic Encoding of Elliptic Codes with Dynamic Information Sets

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

  2023cites this paper
• The Re-encoding Transform in Algebraic List Decoding of Algebraic Geometric Codes

  2023cites this paper
• Fast List Decoding of Univariate Multiplicity and Folded Reed-Solomon Codes

  2023influential citation
• Higher-Order MDS Codes

  2022cites this paper
• Coded Compressed Sensing With List Recoverable Codes for the Unsourced Random Access

  2022cites this paper
• Partially Parallel Low-Complexity Chase Decoding of Reed-Solomon Codes

  2022cites this paper
• Sparsity Bound of Polynomials with Bounded Individual Degree

  2022cites this paper
• Sparsity Bounds of Square Polynomials

  2022cites this paper
• Ordered Reliability Bits Guessing Random Additive Noise Decoding

  2022cites this paper
• Improved Biometrics-Authenticated Key Exchange

  2022cites this paper
• Elliptic Curve Fast Fourier Transform (ECFFT) Part II: Scalable and Transparent Proofs over All Large Fields

  2022cites this paper
• Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting

  2022influential citation
• RedShift: Transparent SNARKs from List Polynomial Commitments

  2022cites this paper
• A New Decoding Method for Reed–Solomon Codes Based on FFT and Modular Approach

  2022cites this paper
• Practical Privacy-Preserving Authentication for SSH

  2022cites this paper
• Algebraic Chase Decoding of Elliptic Codes Through Computing the Gröbner Basis

  2022cites this paper
• A summary on the FRI low degree test

  2022cites this paper
• Verifiable Quantum Advantage without Structure

  2022cites this paper
• Design considerations for advancing data storage with synthetic DNA for long-term archiving

  2022cites this paper
• Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves

  2022cites this paper
• Fast Decoding of AG Codes

  2022cites this paper
• Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring

  2022cites this paper