SearcharxivSearch

arXiv · 2609.20190

Some MDS and ACD codes over commutative non-unital rings of orders 4 and 9 (Revision)

Abstract

There are eleven finite rings of order $p^{2}$ denoted by $A_p$ to $K_p$ in alphabetical order. In particular, we consider $I_{2}$ and $I_{3}$ which are commutative non-unital rings of orders 4 and 9 defined by generators and relations as \[I_{p}=\left\langle a,b\mid pa=pb=0,\:a^{2}=b,\:ab=0\right\rangle\] for $p=2, 3,$ respectively. Alahmadi et al. studied codes over these rings. In this paper, we study additive complementary dual (ACD) codes over the rings $I_{2}$ and $I_{3}$. We show relations between ACD codes over $I_{2}$ and binary linear complementary dual (LCD) codes using a reduction map from $I_{2}$ to $\mathbb{F}_{2}$, and between ACD codes over $I_{3}$ and ternary LCD codes using a reduction map from $I_{3}$ to $\mathbb{F}_{3}$. Using the first relation, we classify ACD codes over $I_{2}$ with the highest minimum distances for $n=1, 2, 3$ and partially for $n=4, 5$. It turns out that they are maximum distance separable (MDS) codes. Using the second relation, we classify ACD codes over $I_{3}$ with the highest minimum Lee distances for $n=1, 2$ and partially for $n=3$. We generalize the two relations into a relation between ACD codes over $I_{p}$ and $p$-ary LCD codes using a reduction map from $I_{p}$ to $\mathbb{F}_{p}$. This is a correction of the paper published in Advances in Mathematics of Communications, Volume 24, pages 61-76, 2026. In particular, we corrected the statements of Theorems 3.5, 4.7, 4.8, and their proofs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jon-Lark Kim, Marvin Olavides, Young Gun Roe. 2026-07-24. Some MDS and ACD codes over commutative non-unital rings of orders 4 and 9 (Revision). https://doi.org/10.3934/amc.2026028

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT