A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime (Q3870263): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Irving S. Reed / rank | |||
| Property / author | |||
| Property / author: Trieu-Kien Truong / rank | |||
| Property / author | |||
| Property / author: Irving S. Reed / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Trieu-Kien Truong / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/tassp.1979.1163287 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1976465614 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:06, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime |
scientific article |
Statements
A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime (English)
0 references
1979
0 references
algorithm
0 references
Gaussian complex integers
0 references
Galois field
0 references
primitive elements
0 references
Mersenne prime
0 references
