arXiv subjects

Anup Kushwaha

Publications and source records attributed to Anup Kushwaha.

3 recordsLinked to original sources

arXiv2026

Symplectic Hulls over a Non-Unital Ring

This paper presents the study of the symplectic hulls over a non-unital ring $ E= \langle κ,τ\mid 2 κ=2 τ=0,~ κ^2=κ,~ τ^2=τ,~ κτ=κ,~ τκ=τ\rangle$. We first identify the residue and torsion codes of the left, right, and two-sided symplectic hulls, and characterize the generator matrix of the two-sided symplectic hull of a free $E$-linear code. Then, we explore the symplectic hull of the sum of two free $E$-linear codes. Subsequently, we provide two build-up techniques that extend a free $E$-linear code of smaller length and symplectic hull-rank to one of larger length and symplectic hull-rank. Further, for free $E$-linear codes, we discuss the permutation equivalence and investigate the symplectic hull-variation problem. An application of this study is given by classifying the free $E$-linear optimal codes for smaller lengths.

cs.IT↗

arXiv2025

Hulls of Free Linear Codes over a Non-Unital Ring

This paper investigates the hull codes of free linear codes over a non-unital ring $ E= \langle κ,τ\mid 2 κ=2 τ=0,~ κ^2=κ,~ τ^2=τ,~ κτ=κ,~ τκ=τ\rangle$. Initially, we examine the residue and torsion codes of various hulls of $E$-linear codes and obtain an explicit form of the generator matrix of the hull of a free $E$-linear code. Then, we propose four build-up construction methods to construct codes with a larger length and hull-rank from codes with a smaller length and hull-rank. Some illustrative examples are also given to support our build-up construction methods. Subsequently, we study the permutation equivalence of two free $E$-linear codes and discuss the hull-variation problem. As an application, we classify optimal free $E$-linear codes for lengths up to $8$.

cs.IT↗

arXiv2025

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

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.

cs.IT↗