On Algebraic Properties of Primitive Eisenstein Integers with Applications in Coding Theory
Open Access
Abstract
An even Eisenstein integer is a multiple of an Eisenstein prime of the least norm. Otherwise, an Eisenstein integer is called odd. An Eisenstein integer that is not an integer multiple of another one is said to be primitive. Such integers can be used to construct signal constellations and complex-valued codes over Eisenstein integers via a carefully designed modulo function. In this work, we establish algebraic properties of even, odd, and primitive Eisenstein integers. We investigate conditions for the set of all units in a given quotient ring of Eisenstein integers to form a cyclic group. We perform set partitioning based on the multiplicative group of the set. This generalizes the known partitioning of size a prime number congruent to 1 modulo 3 based on the multiplicative group of the Eisenstein field in the literature.Keywords
This publication has 27 references indexed in Scilit:
- Encoder Lipschitz integers: the Lipschitz integers that have the “division with small remainder” propertyRendiconti del Circolo Matematico di Palermo Series 2, 2024
- Rabin Public-Key Cryptosystem in the Domain of Gaussian Integers2018
- Signal constellations employing multiplicative groups of Gaussian and Eisenstein integers for Enhanced Spatial ModulationPhysical Communication, 2017
- ETRU: NTRU over the Eisenstein integersDesigns, Codes and Cryptography, 2013
- Finding Factors of Factor Rings over the Gaussian IntegersThe American Mathematical Monthly, 2005
- Multiplicative groups used for coding QAM signalsIMA Journal of Mathematical Control and Information, 2002
- Lattice constellations and codes from quadratic number fieldsIEEE Transactions on Information Theory, 2001
- Groups of algebraic integers used for coding QAM signalsIEEE Transactions on Information Theory, 1998
- Codes over Eisenstein-Jacobi integers1994
- A Classical Introduction to Modern Number Theory1990