Related papers: On isodual double Toeplitz codes
Due to some practical applications, linear complementary dual (LCD) codes and self-orthogonal codes have attracted wide attention in recent years. In this paper, we use simplicial complexes for construction of an infinite family of binary…
We give constructions of self-dual and formally self-dual codes from group rings where the ring is a finite commutative Frobenius ring. We improve the existing construction given in \cite{Hurley1} by showing that one of the conditions given…
In this paper, we present a new bordered construction for self-dual codes which employs $\lambda$-circulant matrices. We give the necessary conditions for our construction to produce self-dual codes over a finite commutative Frobenius ring…
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…
We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their $\ell$-complementary subspaces, i.e., the subspaces that intersect their dual in dimension $\ell$. This concept generalizes…
A linear code is called an MDS self-dual code if it is both an MDS code and a self-dual code with respect to the Euclidean inner product. The parameters of such codes are completely determined by the code length. In this paper, we consider…
The additive codes may have better parameters than linear codes. However, it is still a challenging problem to efficiently construct additive codes that outperform linear codes, especially those with greater distances than linear codes of…
Affine Grassmann codes are a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. These codes were introduced in a recent work [2]. Here we consider, more generally, affine Grassmann codes of a given level.…
Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy…
Most design approaches for trellis-coded quantization take advantage of the duality of trellis-coded quantization with trellis-coded modulation, and use the same empirically-found convolutional codes to label the trellis branches. This…
The main result here is a characterisation of binary $2$-neighbour-transitive codes with minimum distance at least $5$ via their minimal subcodes, which are found to be generated by certain designs. The motivation for studying this class of…
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…
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…
We consider codes over the two semi-local non-unital rings of order six, \[ H_{23} = \langle a,b \mid 2a=0, 3b = 0, a^2=a, b^2 = 0, ab = 0 = ba \rangle,\] and \[H_{32} = \langle a,b \mid 2a=0, 3b = 0, a^2=0, b^2 = b, ab = 0 = ba \rangle. \]…
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…
For $(n,d)= (66,17),(78,19)$ and $(94,21)$, we construct quantum $[[n,0,d]]$ codes which improve the previously known lower bounds on the largest minimum weights among quantum codes with these parameters. These codes are constructed from…
In this paper we introduce self-dual cyclic and quantum codes over Z2^{\alpha} x (Z2 + uZ2)^{\beta}. We determine the conditions for any Z2Z2[u]-cyclic code to be self-dual, that is, C = C^{\perp}. Since the binary image of a…
Using the method for constructing binary self-dual codes with an automorphism of order square of a prime number we have classified all binary self-dual codes with length 76 having minimum distance $d=14$ and automorphism of order 9. Up to…
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…
In this note, we give basic properties of ternary four-negacirculant self-dual codes. By exhaustive computer search based on the properties, we complete a classification of ternary extremal four-negacirculant self-dual codes of lengths 40,…