FFT Algorithm for Binary Extension Finite Fields and Its Application to Reed–Solomon Codes

DOI10.1109/TIT.2016.2600417zbMath1359.94717arXiv1503.05761OpenAlexW2963700143MaRDI QIDQ2976545

Tareq Y. Al-Naffouri, Sian-Jheng Lin, Yunghsiang Sam Han

Publication date: 28 April 2017

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

Full work available at URL: https://arxiv.org/abs/1503.05761

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (1)

Fast transforms over finite fields of characteristic two

This page was built for publication: FFT Algorithm for Binary Extension Finite Fields and Its Application to Reed–Solomon Codes