|
This article is cited in 8 scientific papers (total in 8 papers)
NUMERICAL METHODS AND DATA ANALYSIS
Ternary number systems in finite fields
V. M. Chernovab a Samara National Research University, 34, Moskovskoye shosse, Samara, 443086, Samara, Russia
b IPSI RAS – Branch of the FSRC “Crystallography and Photonics” RAS, Molodogvardeyskaya 151, 443001, Samara, Russia
Abstract:
The work continues the author's previous study of positional number systems in finite fields. The paper considers ternary number systems and arithmetic operations algorithms for the representation of elements of finite fields in the so-called ternary reduced number systems, which are reductions of the canonical number systems when mapping the corresponding ring of integers of a quadratic field into some prime field. A classification of finite fields in which such number systems exist is given. It is proved that the reduced ternary number systems exist for most finite prime fields.
Keywords:
canonical and reduced number systems, finite fields, machine arithmetic.
Received: 20.06.2018 Accepted: 27.07.2018
Citation:
V. M. Chernov, “Ternary number systems in finite fields”, Computer Optics, 42:4 (2018), 704–711
Linking options:
https://www.mathnet.ru/eng/co552 https://www.mathnet.ru/eng/co/v42/i4/p704
|
Statistics & downloads: |
Abstract page: | 239 | Full-text PDF : | 69 | References: | 20 |
|