On fundamental sets over a finite field
A partition over finite field is defined and each equivalence class is constructed and represented by a set called the fundamental set. If a primitive element is used to construct the addition table over these fundamental sets then all additions over the field can be computed. The number of partitio...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1985-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171285000394 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A partition over finite field is defined and each equivalence class is constructed and represented by a set called the fundamental set. If a primitive element is used to construct the addition table over these fundamental sets then all additions over the field can be computed. The number of partitions is given for some finite fields. |
|---|---|
| ISSN: | 0161-1712 1687-0425 |