Related papers: On the Structure of the Linear Codes with a Given …
A binary linear code whose permutation automorphism group has a fixed point free permutation of order $3$ is called a binary cubic code. The scope of this paper is to investigate the structural properties of binary cubic codes. Let $C$ be a…
Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight…
Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on…
We continue the study of the class of binary extended perfect propelinear codes constructed in the previous paper and consider their permutation automorphism (symmetry) groups and Steiner quadruple systems. We show that the automorphism…
One of the most important and challenging problems in coding theory is to determine the optimal values of the parameters of a linear code and to explicitly construct codes with optimal parameters, or as close to the optimal values as…
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime power $q$, we construct some class of linear code over finite field $\mathbb{F}_q$ with defining set be the preimage of…
In this paper, we study the codes over the matrix ring over $\mathbb{Z}_4$, which is perhaps the first time the ring structure $M_2(\mathbb{Z}_4)$ is considered as a code alphabet. This ring is isomorphic to…
Linear complementary dual codes (LCD) intersect trivially with their dual. In this paper, we develop a new characterization for LCD codes, which allows us to judge the complementary duality of linear codes from the codeword level. Further,…
The main purpose of thispaper is to show that composite quantum-like (QL) systems can closely mimic the separable states of quantum systems, and that suitable physical systems exhibiting these states exist. It is shown that QL graphs can…
In this paper, we construct several infinite families of $q$-ary constacyclic codes over a finite field $\mathbb{F}_q$ with length $n$, dimension around $n/2$, and minimum distance at least $cn/\log_q n$ for some positive constant $c$. They…
The hull of a linear code $C$ is the intersection of $C$ with its dual code. We present and analyze the number of linear $q$-ary codes of the same length and dimension but with different dimensions for their hulls. We prove that for given…
Let $\texttt{R}$ be a commutative finite chain ring of invariants $(q,s).$ In this paper, the trace representation of any free cyclic $\texttt{R}$-linear code of length $\ell,$ is presented, via the $q$-cyclotomic cosets modulo $\ell,$ when…
Two isometry groups of combinatorial codes are described: the group of automorphisms and the group of monomial automorphisms, which is the group of those automorphisms that extend to monomial maps. Unlike the case of classical linear codes,…
The monomial codes over a Galois field F_q that can be thought invariant subspaces are essential to us in this study. More specifically, we look into the link between monomial codes and characteristic subspaces and the decomposition of…
For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…
The automorphism groups of various linear codes are extensively studied yielding insights into the respective code structure. This knowledge is used in, e.g., theoretical analysis and in improving decoding performance, motivating the…
Constacyclic codes are important classes of linear codes that have been applied to the construction of quantum codes. Six new families of asymmetric quantum codes derived from constacyclic codes are constructed in this paper. Moreover, the…
In this paper, we investigate the existence of self-dual MRD codes $C\subset L^n$, where $L/F$ is an arbitrary field extension of degree $m\geq n$. We then apply our results to the case of finite fields, and prove that if $m=n$ and…
A code is said to be two-weight if the non-zero codewords have only two different a weight w1 and w2. Two-weight codes are closely related to strongly regular graphs. In this paper. It is shown that a consta-cyclic code of composite length…
An \emph{automorphic loop} (or \emph{A-loop}) is a loop whose inner mappings are automorphisms. Every element of a commutative A-loop generates a group, and $(xy)^{-1} = x^{-1}y^{-1}$ holds. Let $Q$ be a finite commutative A-loop and $p$ a…