A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime

DOI10.1109/TASSP.1979.1163287zbMATH Open0432.65068OpenAlexW1976465614MaRDI QIDQ3870263FDOQ3870263

Authors: Robert Miller, I. S. Reed, Trieu-Kien Truong

Publication date: 1979

Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tassp.1979.1163287

zbMATH Keywords

algorithm primitive elements Mersenne prime Galois field Gaussian complex integers

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Arithmetic theory of polynomial rings over finite fields (11T55) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to field theory (12-04)

Cited In (1)

Parameter Determination for Complex Number-Theoretic Transforms Using Cyclotomic Polynomials

This page was built for publication: A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3870263)