Related papers: Construction of isodual codes from polycirculant m…
We define an abstract regular polytope to be internally self-dual if its self-duality can be realized as one of its symmetries. This property has many interesting implications on the structure of the polytope, which we present here. Then,…
The article reviews different definitions for a convolutional code which can be found in the literature. The algebraic differences between the definitions are worked out in detail. It is shown that bi-infinite support systems are dual to…
Binary self-dual sequences have been considered and analyzed throughout the years, and they have been used for various applications. Motivated by a construction for single-track Gray codes, we examine the structure and recursive…
Multi-twisted (MT) codes were introduced as a generalization of quasi-twisted (QT) codes. QT codes have been known to contain many good codes. In this work, we show that codes with good parameters and desirable properties can be obtained…
The ring in the title is the first non commutative ring to have been used as alphabet for block codes. The original motivation was the construction of some quaternionic modular lattices from codes. The new application is the construction of…
Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing \cite{Jia} as well as Kai and Zhu \cite{Kai} proved that Euclidean self-dual cyclic codes of length $n$ over $\mathbb{F}_q$ exist if and only if…
We review the general formalism of duality rotations for $\cal N$-extended (super)conformal gauge multiplets of arbitrary (super)spin in four dimensions, with ${\cal N} \geq 0$. Self-dual models for a vector field (${\cal N}=0$) and for…
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…
In this paper, we investigate the existence and asymptotic property of self-dual $2$-quasi negacyclic codes of length $2n$ over a finite field of cardinality $q$. When $n$ is odd, we show that the $q$-ary self-dual $2$-quasi negacyclic…
Linear complementary dual (LCD) codes over finite fields are linear codes satisfying $C\cap C^{\perp}=\{0\}$. We generalize the LCD codes over finite fields to $\mathbb{Z}_2\mathbb{Z}_2[u]$-LCD codes over the ring…
Binary cyclic codes have been a hot topic for many years, and significant progress has been made in the study of this types of codes. As is well known, it is hard to construct infinite families of binary cyclic codes [n, n+1/2] with good…
A flag $C_0 \subsetneq C_1 \cdots \subsetneq C_s \subsetneq {\mathbb F}_q^n $ of linear codes is said to be self-orthogonal if the duals of the codes in the flag satisfy $C_{i}^\perp=C_{s-i}$, and it is said to satisfy the isometry-dual…
Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…
In this work, extension theorems are generalized to self-dual codes over rings and as applications many new binary self-dual extremal codes are found from self-dual codes over F_2^m+uF_2^m for m = 1, 2. The duality and distance preserving…
In this article, we construct integrally closed modules of rank two over a two-dimensional regular local ring. The modules are explicitly constructed from a given complete monomial ideal with respect to a regular system of parameters. Then…
A linear code is said to be self-orthogonal if it is contained in its dual. Self-orthogonal codes are of interest because of their important applications, such as for constructing linear complementary dual (LCD) codes and quantum codes. In…
We construct a ternary [49,25,7] code from the row span of a Jacobsthal matrix. It is equivalent to a Generalized Quadratic Residue (GQR) code in the sense of van Lint and MacWilliams (1978). These codes are the abelian generalizations of…
The existence of optimal binary self-dual codes is a long-standing research problem. In this paper, we present some results concerning the decomposition of binary self-dual codes with a dihedral automorphism group $D_{2p}$, where $p$ is a…
Irreducible trinomials of given degree n over $F_2$ do not always exist and in the cases that there is no irreducible trinomial of degree n it may be effective to use trinomials with an irreducible factor of degree n. In this paper we…
Linear complementary dual (LCD) codes are linear codes which intersect their dual codes trivially, which have been of interest and extensively studied due to their practical applications in computational complexity and information…