Power decoding Reed-Solomon codes up to the Johnson radius
From MaRDI portal
Publication:1783708
DOI10.3934/amc.2018005zbMath1414.94952arXiv1505.02111OpenAlexW2338321373MaRDI QIDQ1783708
Publication date: 21 September 2018
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.02111
Related Items
Algorithms for simultaneous Hermite-Padé approximations ⋮ Improved power decoding of interleaved one-point Hermitian codes ⋮ Power error locating pairs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x\)]
- A general module theoretic framework for vector M-Padé and matrix rational interpolation
- List decoding of Hermitian codes using Gröbner bases
- A linear algebraic approach to multisequence shift-register synthesis
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- Solving structured linear systems with large displacement rank
- Key equations for list decoding of Reed-Solomon codes and how to solve them
- Decoding of Reed Solomon codes beyond the error-correction bound
- On lattice reduction for polynomial matrices
- Improved power decoding of interleaved one-point Hermitian codes
- High-order lifting and integrality certification
- Fast skew-feedback shift-register synthesis
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- Approximate common divisors via lattices
- Sub-Quadratic Decoding of One-Point Hermitian Codes
- Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations
- Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations
- Algorithms for Simultaneous Padé Approximations
- Efficient Interpolation in the Wu List Decoding Algorithm
- A New Algorithm for Decoding Reed-Solomon Codes
- Power Decoding of Reed–Solomon Codes Revisited
- Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
- Algebraic soft-decision decoding of reed-solomon codes
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- A method for solving key equation for decoding goppa codes
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance
- On the key equation
- An Interpolation Procedure for List Decoding Reed–Solomon Codes Based on Generalized Key Equations
- VLSI Architectures for Soft-Decision Decoding of Reed–Solomon Codes
- Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis
- On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa Codes
- Introduction to Coding Theory
This page was built for publication: Power decoding Reed-Solomon codes up to the Johnson radius
