Reformulated Partial-Inverse Algorithms for Time-Domain Reed–Solomon Codes With Hardware Considerations
- 1 January 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74, 3708-3723
Abstract
No abstract availableThis publication has 36 references indexed in Scilit:
- Efficient Algorithm for Finding Roots of Error-Locator PolynomialsIEEE Access, 2021
- Reed–Solomon Decoder Based on a Modified ePIBMA for Low-Latency 100 Gbps Communication SystemsCircuits, Systems, and Signal Processing, 2018
- On the equivalence of the Berlekamp-Massey and the euclidean algorithms for algebraic decoding2011
- From the Euclidean Algorithm for Solving a Key Equation for Dual Reed–Solomon Codes to the Berlekamp–Massey AlgorithmLecture Notes in Computer Science, 2009
- Simplified Degree Computationless Modified Euclid's Algorithm and its Architecture2007
- Introduction to Coding Theory2006
- Fast, prime factor, discrete Fourier transform algorithms over GF(2 ) for 8 ⩽m⩽ 10Information Sciences, 2006
- High-speed architectures for Reed-Solomon decodersIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2001
- On the equivalence of the Berlekamp-Massey and the Euclidean algorithms for decodingIEEE Transactions on Information Theory, 2000
- A method for solving key equation for decoding goppa codesInformation and Control, 1975