Nianqi Tang

Fast Encoding and Decoding Algorithms for Arbitrary $(n,k)$ Reed-Solomon Codes Over $\mathbb{F}_{2^m}$

2020 · IEEE Communications Letters

Recently, a new polynomial basis over finite fields was proposed such that the computational complexity of the fast Fourier transform (FFT) is O(n log n). Based on FFTs, the encoding and decoding algorithms for Reed-Solomon …