An Algorithm for Finding Self-Orthogonal and Self-Dual Codes Over Gaussian and Eisenstein Integer Residue Rings Via Chinese Remainder Theorem
A code over Gaussian or Eisenstein integer residue ring is an additive group of vectors with entries in this integer residue ring which is closed under the action of constant multiplication by the Gaussian or Eisenstein integers. In this paper, we define the dual codes for the codes over the Gaussia...
Main Author: | Hajime Matsui |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10061406/ |
Similar Items
-
Mass Formula for Self-Orthogonal and Self-Dual Codes over Non-Unital Rings of Order Four
by: Adel Alahmadi, et al.
Published: (2023-11-01) -
The mass formula for self-orthogonal and self-dual codes over a non-unitary commutative ring
by: Adel Alahmadi, et al.
Published: (2023-08-01) -
Reversible Self-Dual Codes Over the Ring F<sub>2</sub> + <italic>u</italic>F<sub>2</sub>
by: Hyun Jin Kim, et al.
Published: (2024-01-01) -
The Mass Formula for Self-Orthogonal and Self-Dual Codes over a Non-Unitary Non-Commutative Ring
by: Adel Alahmadi, et al.
Published: (2024-03-01) -
Generalized Concatenated Codes over Gaussian and Eisenstein Integers for Code-Based Cryptography
by: Johann-Philipp Thiers, et al.
Published: (2021-11-01)