Optimal binary codes from $\mathcal{C}_{D}$-codes over a non-chain ring
By: Ankit Yadav, Ritumoni Sarma, Anuj Kumar Bhagat
Potential Business Impact:
Makes computer codes more efficient and secure.
In \cite{shi2022few-weight}, Shi and Li studied $\mathcal{C}_D$-codes over the ring $\mathcal{R}:=\mathbb{F}_2[x,y]/\langle x^2, y^2, xy-yx\rangle$ and their binary Gray images, where $D$ is derived using certain simplicial complexes. We study the subfield codes $\mathcal{C}_{D}^{(2)}$ of $\mathcal{C}_{D}$-codes over $\mathcal{R},$ where $D$ is as in \cite{shi2022few-weight} and more. We find the Hamming weight distribution and the parameters of $\mathcal{C}_D^{(2)}$ for various $D$, and identify several infinite families of codes that are distance-optimal. Besides, we provide sufficient conditions under which these codes are minimal and self-orthogonal. Two families of strongly regular graphs are obtained as an application of the constructed two-weight codes.
Similar Papers
Linear codes over $\frac{\mathbb{F}_q[u]}{\langle u^2 \rangle}$ with mixed-alphabet defining sets and their Gray images: Constructions of projective few-weight, distance-optimal and minimal codes
Information Theory
Creates better codes for secret messages and sharing.
Weight distributions of simplex codes over finite chain rings and their Gray map images
Information Theory
Creates better codes for sending secret messages.
The complete weight distribution of a family of irreducible cyclic codes of dimension two
Information Theory
Finds hidden patterns in secret codes.