Reducing the number of operations in certain finite- field transforms (Corresp.)

DOI10.1109/TIT.1984.1056908zbMath0541.94031OpenAlexW2120394846MaRDI QIDQ3329388

David M. Mandelbaum

Publication date: 1984

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

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

zbMATH Keywords

BCH codesdiscrete Fourier transformReed-Solomon codessparse polynomialsfinite-field transformsGoertzel transformWinograd transform

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Decoding (94B35)

This page was built for publication: Reducing the number of operations in certain finite- field transforms (Corresp.)