Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders

DOI10.1109/26.923801zbMath1014.94022OpenAlexW2090509469MaRDI QIDQ4552984

Jyh-Horng Jeng, Trieu-Kien Truong, Irving S. Reed

Publication date: 30 June 2003

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5c96f8ab56d0bca49a7813763b96cb650817f945

zbMATH Keywords

Reed-Solomon codeerror locator polynomial\(p\)-polynomialBerlekamp-Rumsey-Solomon algorithmChien search

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Related Items (2)

The generalized Goertzel algorithm and its parallel hardware implementation ⋮ Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)

This page was built for publication: Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders