The fast decoding of Reed-Solomon codes using Fermat transforms (Corresp.)
- 1 July 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 24 (4) , 497-499
- https://doi.org/10.1109/tit.1978.1055902
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Hardware realization of a Fermat number transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
- On the complexity of decoding Reed-Solomon codes (Corresp.)IEEE Transactions on Information Theory, 1976
- Number theoretic transforms to implement fast digital convolutionProceedings of the IEEE, 1975
- The use of finite fields to compute convolutionsIEEE Transactions on Information Theory, 1975
- Discrete Convolutions via Mersenne TransformsIEEE Transactions on Computers, 1972
- On decoding of Reed-Solomon codesIEEE Transactions on Information Theory, 1971
- On decoding BCH codesIEEE Transactions on Information Theory, 1965
- Polynomial Codes Over Certain Finite FieldsJournal of the Society for Industrial and Applied Mathematics, 1960
- A class of multiple-error-correcting codes and the decoding schemeTransactions of the IRE Professional Group on Information Theory, 1954