Open Access
Efficient NTT algorithms for prime numbers
Ryszard Stasinski
- 01 Jan 1989
1
About: The article was published on 01 Jan 1989. and is currently open access. The article focuses on the topics: Prime number.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Fourier transform algorithm for a prime number blocklength Reed-Solomon code can be computationally efficient
R. Stasinski
- 27 Jun 1994
TL;DR: In the paper efficient computation of used in Reed-Solomon code decoders p-point discrete Fourier transforms in finite fields for p being a prime number is considered.
1