A New Algorithm for Decoding Reed-Solomon Codes

DOI10.1007/978-1-4757-3789-9_5zbMath1330.94063OpenAlexW966573063MaRDI QIDQ3448743

Shuhong Gao

Publication date: 27 October 2015

Published in: Communications, Information and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4757-3789-9_5

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Related Items

Duality of constacyclic codes of prime power length over the finite non-commutative chain ring \(\frac{ \mathbb{F}_{p^m} [ u , \theta }{ \langle u^2 \rangle} \)], Fast operations on linearized polynomials and their applications in coding theory, Power Decoding of Reed–Solomon Codes Revisited, ON DECODING ALGORITHMS FOR GENERALIZED REED — SOLOMON CODES WITH ERRORS AND ERASURES, Simple algorithms for decoding systematic Reed-Solomon codes, Biorthogonal wavelet codes with prescribed code distance, Decoding algorithms for Goppa codes with errors and erasures, ON DECODING ALGORITHMS FOR GENERALIZED REED — SOLOMON CODES WITH ERRORS AND ERASURES. II, ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS, A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes, Polynomial root finding over local rings and application to error correcting codes, Two-dimensional generalized discrete Fourier transform and related quasi-cyclic Reed--Solomon codes, On decoding algorithms for Goppa codes, Power decoding Reed-Solomon codes up to the Johnson radius, Rank-Metric Codes and Their Applications

Cites Work

• On arithmetical algorithms over finite fields
• Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
• Polynomial Codes Over Certain Finite Fields
• A method for solving key equation for decoding goppa codes
• Additive Fast Fourier Transforms Over Finite Fields
• A Class of Error-Correcting Codes in $p^m $ Symbols
• Shift-register synthesis and BCH decoding
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item