Related papers: Self-dual codes over $GF(q)$ with symmetric genera…
In this work, new construction methods for self-dual codes are given. The methods use the short Kharaghani array and a variation of it. These are applicable to any commutative Frobenius ring. We apply the constructions over the ring F_2 +…
To address the challenge of constructing short girth-8 quasi-cyclic (QC) low-density parity-check (LDPC) codes, a novel construction framework based on vertical symmetry (VS) is proposed. Basic properties of the VS structure are presented.…
In this paper we obtain the [60,30,12], [64,32,12], [68,34,12], [72,36,12] self-dual codes as tailbitting convolutional codes with the smallest constraint length K=9. In this construction one information bit is modulo two added to the one…
The mds (maximum distance separable) conjecture claims that a nontrivial linear mds $[n,k]$ code over the finite field $GF(q)$ satisfies $n \leq (q + 1)$, except when $q$ is even and $k = 3$ or $k = q- 1$ in which case it satisfies $n \leq…
We study one generator quasi-cyclic codes and four-circulant codes, which are also quasi-cyclic but have two generators. We state the hull dimensions for both classes of codes in terms of the polynomials in their generating elements. We…
Four circulant codes form a special class of $2$-generator, index $4$, quasi-cyclic codes. Under some conditions on their generator matrices they can be shown to be self-dual. Artin primitive root conjecture shows the existence of an…
Currently, the existence of an extremal singly even self-dual code of length $24k+10$ is unknown for all nonnegative integers $k$. In this note, we study singly even self-dual $[24k+10,12k+5,4k+2]$ codes. We give some restrictions on the…
Minimal rank-metric codes or, equivalently, linear cutting blocking sets are characterized in terms of the second generalized rank weight, via their connection with evasiveness properties of the associated $q$-system. Using this result, we…
Recently, simplicial complexes are used in constructions of several infinite families of minimal and optimal linear codes by Hyun {\em et al.} Building upon their research, in this paper more linear codes over the ring $\mathbb{Z}_4$ are…
In this paper, we provide two methods of constructing quantum codes from linear codes over finite chain rings. The first one is derived from the Calderbank-Shor-Steane (CSS) construction applied to self-dual codes over finite chain rings.…
Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over…
Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received…
We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…
A classification of extremal double circulant self-dual codes of lengths up to $88$ is known. We give a classification of extremal double circulant self-dual codes of lengths $90,92,94$ and $96$. We also classify double circulant self-dual…
In this paper, we study a class of subcodes of codimension $1$ in the $[n,k+1]_q$ generalized Reed-Solomon (GRS) codes, whose generator matrix is derived by removing the row of degree $k-r$ from the generator matrix of the $[n,k+1]_q$ GRS…
MDS self-dual codes have nice algebraic structures and are uniquely determined by lengths. Recently, the construction of MDS self-dual codes of new lengths has become an important and hot issue in coding theory. In this paper, we develop…
In this paper, based on the theory of defining sets, two classes of five-weight or six-weight linear codes over Fp are constructed. The weight distributions of the linear codes are determined by means of Weil sums and a new type of…
We use multidimensional circulant approach to construct new qutrit stabilizer $\dsb{\ell, 0, d}$ codes with parameters $(\ell, d) \in \{(51, 16), (52, 16), (54, 17), (55, 17), (57, 17)\}$ through symplectic self-dual additive codes over…
We present a family of reducible cyclic codes constructed as the direct sum of two different semiprimitive two-weight irreducible cyclic codes. This family generalizes the class of reducible cyclic codes that was reported in the main result…