相关论文: Self-dual 2-quasi Negacyclic Codes over Finite Fie…

In this paper, we study a special kind of factorization of $x^n+1$ over $\mathbb{F}_q, $ with $q$ a prime power $\equiv 3~({\rm mod}~4)$ when $n=2p,$ with $p\equiv 3~({\rm mod}~4)$ and $p$ is a prime. Given such a $q$ infinitely many such…

Good integers introduced in 1997 form an interesting family of integers that has been continuously studied due to their rich number theoretical properties and wide applications. In this paper, we have focused on classes of $2^\beta$-good…

This paper introduces a class of Hermitian LCD $2$-quasi-abelian codes over finite fields and presents a comprehensive enumeration of these codes in which relative minimum weights are small. We show that such codes are asymptotically good…

In this paper, several conjectures proposed in [2] are studied, involving the equivalence and duality of polycyclic codes associated with trinomials. According to the results, we give methods to construct isodual and self-dual polycyclic…

In this paper, we obtain some new results on the existence of MDS self-dual codes utilizing (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. For some fixed $q$, our results can produce more classes of MDS…

Duadic codes are a class of cyclic codes that generalizes quadratic residue codes from prime to composite lengths. For every prime power q, we characterize the integers n such that over the finite field with q^2 elements there is a duadic…

We show that every self-orthogonal code over $\mathbb F_q$ of length $n$ can be extended to a self-dual code, if there exists self-dual codes of length $n$. Using a family of Galois towers of algebraic function fields we show that over any…

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…

Self-dual codes over finite fields and over some finite rings have been of interest and extensively studied due to their nice algebraic structures and wide applications. Recently, characterization and enumeration of Euclidean self-dual…

This article studies one-generator and two-generator quasi-cyclic codes over finite fields. We present two versions of necessary and sufficient conditions for the symplectic selforthogonality of one-generator quasi-cyclic codes, using both…

Double Toeplitz (shortly DT) codes are introduced here as a generalization of double circulant codes. We show that such a code is isodual, hence formally self-dual. Self-dual DT codes are characterized as double circulant or double…

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…

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…

Constacyclic codes contain cyclic codes as a subclass and have nice algebraic structures. Constacyclic codes have theoretical importance, as they are connected to a number of areas of mathematics and outperform cyclic codes in several…

We provide a polynomial approach to investigate linear complementary dual (LCD) quasi-cyclic codes over finite fields. We establish necessary and sufficient conditions for LCD quasi-cyclic codes of index 2 with respect to the Euclidean,…

There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…

A complementary Gray code for binary n-tuples is one that, when all the tuples are complemented, is identical to itself; this is equivalent to the complement of the first half of the code being identical to the second half. We generalize…

Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…

Double polycirculant codes are introduced here as a generalization of double circulant codes. When the matrix of the polyshift is a companion matrix of a trinomial, we show that such a code is isodual, hence formally self-dual. Numerical…

Two families of complementary codes over finite fields $\mathbb{F}_q$ are studied, where $q=r^2$ is square: i) Hermitian complementary dual linear codes, and ii) trace Hermitian complementary dual subfield linear codes. Necessary and…