Hybrid methods for finding roots of a polynomial - With application to BCH decoding (Corresp.)

DOI10.1109/TIT.1969.1054283zbMath0169.50904OpenAlexW2060714552MaRDI QIDQ5556891

Robert Tienwen Chien, I. B. Oldham, B. D. Cunningham

Publication date: 1969

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

Full work available at URL: https://doi.org/10.1109/tit.1969.1054283

zbMATH Keywords

roots of a polynomialapplication to BCH decoding

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Polynomials over finite fields (11T06) Decoding (94B35)

Related Items (4)

Fast algorithms for solving equations of degree \(\le 4\) in some finite fields ⋮ Threshold data structures and coding theory ⋮ Factoring polynomials over finite fields: A survey ⋮ The generalized Goertzel algorithm and its parallel hardware implementation

This page was built for publication: Hybrid methods for finding roots of a polynomial - With application to BCH decoding (Corresp.)