On Codes over Eisenstein Integers
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909754076430336 |
|---|---|
| author | Hadi, Abdul Isnaini, Uha Wijayanti, Indah Emilia Ezerman, Martianus Frederic |
| author_facet | Hadi, Abdul Isnaini, Uha Wijayanti, Indah Emilia Ezerman, Martianus Frederic |
| contents | We propose constructions of codes over quotient rings of Eisenstein integers equipped with the Euclidean, square Euclidean, and hexagonal distances as a generalization of codes over Eisenstein integer fields. By set partitioning, we effectively divide the ring of Eisenstein integers into equal-sized subsets for distinct encoding. Unlike in Eisenstein integer fields of prime size, where partitioning is not feasible due to structural limitations, we partition the quotient rings into additive subgroups in such a way that the minimum square Euclidean and hexagonal distances of each subgroup are strictly larger than in the original set. This technique facilitates multilevel coding and enhances signal constellation efficiency. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_18328 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On Codes over Eisenstein Integers Hadi, Abdul Isnaini, Uha Wijayanti, Indah Emilia Ezerman, Martianus Frederic Information Theory 11R04, 11H71 We propose constructions of codes over quotient rings of Eisenstein integers equipped with the Euclidean, square Euclidean, and hexagonal distances as a generalization of codes over Eisenstein integer fields. By set partitioning, we effectively divide the ring of Eisenstein integers into equal-sized subsets for distinct encoding. Unlike in Eisenstein integer fields of prime size, where partitioning is not feasible due to structural limitations, we partition the quotient rings into additive subgroups in such a way that the minimum square Euclidean and hexagonal distances of each subgroup are strictly larger than in the original set. This technique facilitates multilevel coding and enhances signal constellation efficiency. |
| title | On Codes over Eisenstein Integers |
| topic | Information Theory 11R04, 11H71 |
| url | https://arxiv.org/abs/2412.18328 |