A theorem for computing primitive elements in the field of complex integers of a characteristic Mersenne prime
DOI10.1109/TASSP.1981.1163501zbMATH Open0522.65097MaRDI QIDQ3673055FDOQ3673055
Authors: Robert Miller, I. S. Reed, Trieu-Kien Truong
Publication date: 1981
Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)
fast Fourier transformprimitive elementsGalois fieldcomplex integersnumber-theoretic transformcharacteristic Mersenne prime
Numerical methods for trigonometric approximation and interpolation (65T40) Arithmetic and combinatorial problems involving abstract finite groups (20D60)
This page was built for publication: A theorem for computing primitive elements in the field of complex integers of a characteristic Mersenne prime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3673055)