Related papers: On Codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2…
Let $q$ be a power of a prime $p$. In this paper, we study reversible cyclic codes of arbitrary length over the ring $ R = \mathbb{F}_q + u \mathbb{F}_q$, where $u^2=0 mod q$. First, we find a unique set of generators for cyclic codes over…
We study (Galois) linear complementary dual codes over mixed alphabets arising from finite chain rings. We give a characterization of when a given code is of We study (Galois) linear complementary dual codes over mixed alphabets arising…
In this paper we investigate codes over finite commutative rings R, whose generator matrices are built from \$\alpha\$-circulant matrices. For a non-trivial ideal I<R we give a method to lift such codes over R/I to codes over R, such that…
The hull $H(C)$ of a linear code $C$ is defined by $H(C)=C \cap C^\perp$. A linear code with a complementary dual (LCD) is a linear code with $H(C)=\{0\}$. The dimension of the hull of a code is an invariant under permutation equivalence.…
Sum-rank codes are an important class of codes which can be utilized for linear network coding, space-time coding and distributed storage. They can not only reduce the size of network alphabet but also detect and correct more errors. Based…
The purpose of the present article is the study of duals of functional codes on algebraic surfaces. We give a direct geometrical description of them, using differentials. Even if this geometrical description is less trivial, it can be…
Let $\mathbb{F}_{q}$ be the finite field with $q$ elements. This paper mainly researches the polynomial representation of double cyclic codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^2\mathbb{F}_{q}$ with $v^3=v$. Firstly, we give the…
We introduce a consistent and efficient method to construct self-dual codes over $GF(q)$ with symmetric generator matrices from a self-dual code over $GF(q)$ of smaller length where $q \equiv 1 \pmod 4$. Using this method, we improve the…
Linear complementary dual (LCD) codes can provide an optimum linear coding solution for the two-user binary adder channel. LCD codes also can be used to against side-channel attacks and fault non-invasive attacks. Let $d_{LCD}(n, k)$ denote…
In this work, we study codes over the ring R_{k,m}=F_2[u,v]/<u^{k},v^{m},uv-vu>, which is a family of Frobenius, characteristic 2 extensions of the binary field. We introduce a distance and duality preserving Gray map from R_{k,m} to…
The purpose of this paper is to present the structure of the linear codes over a finite field with q elements that have a permutation automorphism of order m. These codes can be considered as generalized quasi-cyclic codes. Quasi-cyclic…
Linear complementary dual (LCD) codes can be used to against side-channel attacks and fault noninvasive attacks. Let $d_{a}(n,6)$ and $d_{l}(n,6)$ be the minimum weights of all binary optimal linear codes and LCD codes with length $n$ and…
Linear codes are considered over the ring $\mathbb{Z}_4+v\mathbb{Z}_4$, where $v^2=v$. Gray weight, Gray maps for linear codes are defined and MacWilliams identity for the Gray weight enumerator is given. Self-dual codes, construction of…
In recent years, linear complementary pairs (LCP) of codes and linear complementary dual (LCD) codes have gained significant attention due to their applications in coding theory and cryptography. In this work, we construct explicit LCPs of…
Let $f(u)$ and $g(v)$ be any two polynomials of degree $k$ and $\ell$ respectively ($k$ and $\ell$ are not both $1$), which split into distinct linear factors over $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u,v]/\langle…
We present new constructions of binary quantum codes from quaternary linear Hermitian self-dual codes. Our main ingredients for these constructions are nearly self-orthogonal cyclic or duadic codes over F_4. An infinite family of…
We construct two series of linear codes over finite ring $\mathbb{F}_{q}[x]/(x^2)$ and Galois ring $GR(p^2,m)$ respectively reaching the Griesmer bound. They derive two series of codes over finite field $\mathbb{F}_{q}$ by Gray map. The…
We call a linear code $C$ with length $n$ over a field $F$, a linear complementary equi-dual code, when there exists a linear code $D$ over $F$ such that $D$ is permutation equivalent to $C^\perp$ and $(C,D)$ is a linear complementary pair…
Linear complementary dual (LCD) codes are linear codes that intersect with their dual codes trivially. We study the largest minimum weight $d_2(n,k)$ among all binary LCD $[n,k]$ codes and the largest minimum weight $d_3(n,k)$ among all…
We show that a necessary and sufficient condition for a cyclic code C over Z4 of odd length to be an LCD code is that C=(f(x)) where f is a self-reciprocal polynomial in Z4[X].