$\mathbb{F}_q\mathbb{F}_{q^2}$-additive cyclic codes and their Gray images
By: Ankit Yadav, Ritumoni Sarma
Potential Business Impact:
Makes computer codes stronger for better data.
We investigate additive cyclic codes over the alphabet $\mathbb{F}_{q}\mathbb{F}_{q^2}$, where $q$ is a prime power. First, its generator polynomials and minimal spanning set are determined. Then, examples of $\mathbb{F}_{q^2}$-additive cyclic codes that satisfy the well-known Singleton bound are constructed. Using a Gray map, we produce certain optimal linear codes over $\mathbb{F}_{3}$. Finally, we obtain a few optimal ternary linear complementary dual (LCD) codes from $\mathbb{F}_{3}\mathbb{F}_{9}$-additive codes.
Similar Papers
$(Θ, Δ_Θ, \mathbf{a})$-cyclic codes over $\mathbb{F}_q^l$ and their applications in the construction of quantum codes
Information Theory
Creates better codes for computers and quantum computers.
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.
Linear complementary dual quasi-cyclic codes of index 2
Information Theory
Makes computer codes stronger and harder to break.