Search arXivSearch

arXiv · 2501.03016

Classification of LCD and self-dual codes over a finite non-unital local ring

Abstract

This work explores LCD and self-dual codes over a noncommutative non-unital ring $ E_p= \langle r,s ~|~ pr =ps=0,~ r^2=r,~ s^2=s,~ rs=r,~ sr=s \rangle$ of order $p^2$ where $p$ is a prime. Initially, we study the monomial equivalence of two free $E_p$-linear codes. In addition, a necessary and sufficient condition is derived for a free $E_p$-linear code to be MDS and almost MDS (shortly AMDS). Then, we use these results to classify MDS and AMDS LCD codes over $E_2$ and $E_3$ under monomial equivalence for lengths up to $6$. Subsequently, we study left self-dual codes over the ring $E_p$ and classify MDS and AMDS left self-dual codes over $E_2$ and $E_3$ for lengths up to $12$. Finally, we study self-dual codes over the ring $E_p$ and classify MDS and AMDS self-dual codes over $E_2$ and $E_3$ for short lengths.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anup Kushwaha, Indibar Debnath, Om Prakash, Patrick Solé. 2026-06-24. Classification of LCD and self-dual codes over a finite non-unital local ring. https://arxiv.org/abs/2501.03016

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