The following publications are possibly variants of this publication:
- A Future Simplification of Procedure for Decoding Nonsystematic Reed-Solomon Codes Using the Berlekamp-Massey AlgorithmTsung-Ching Lin, Trieu-Kien Truong, Hsin-Chiu Chang, Hung-Peng Lee. tcom, 59(6):1555-1562, 2011. [doi]
- Fast, prime factor, discrete Fourier transform algorithms over ::::GF::::(2:::::::m:::::::) for 8 leq ::::m:::: leq 10Trieu-Kien Truong, Pei-Ding Chen, Lung-Jen Wang, Y.-W. Chang, Irving S. Reed. isci, 176(1):1-26, 2006. [doi]
- On fast Fourier transform-based decoding of Reed-Solomon codesYunghsiang S. Han, Chao Chen, Sian-Jheng Lin, Baoming Bai. ijahuc, 36(3):180-187, 2021. [doi]
- Fast Transform for Decoding Both Errors and Erasures of Reed-Solomon Codes Over GF (2:::m:::) for 8 leq m leq 10Trieu-Kien Truong, Pei-Ding Chen, Lung-Jen Wang, T. C. Cheng. tcom, 54(2):181-186, 2006. [doi]
- The fast decoding of Reed-Solomon codes using Fermat transforms (Corresp.)Irving S. Reed, Trieu-Kien Truong, Lloyd R. Welch. TIT, 24(4):497-499, 1978. [doi]
- Erratum to Fast, prime factor, discrete Fourier transform algorithms over GF(2:::::::m:::::::) for 8 leq ::::m:::: leq 10 [Informat Sci 176 (1) (2006) 1-26]Trieu-Kien Truong, Pei-Ding Chen, Lung-Jen Wang, Y.-W. Chang, Irving S. Reed. isci, 177(3):967-968, 2007. [doi]
- Fast Encoding and Decoding Algorithms for Arbitrary $(n, k)$ Reed-Solomon Codes Over $\mathbb{F}_{2^m}$Nianqi Tang, Yun Lin. icl, 24(4):716-719, 2020. [doi]