Related papers: On self-dual MRD codes
A module $M$ is called an automorphism-invariant module if every isomorphism between two essential submodules of $M$ extends to an automorphism of $M$. This paper introduces the notion of dual of such modules. We call a module $M$ to be a…
We consider linear rank-metric codes in $\mathbb F_{q^m}^n$. We show that the properties of being MRD (maximum rank distance) and non-Gabidulin are generic over the algebraic closure of the underlying field, which implies that over a large…
Let $R$ be a commutative ring with identity. The paper studies the problem of self-orthogonality and self-duality matrix-product codes (MPCs) over $R$. Some methods as well as special matrices are introduced for the construction of such…
It has been proven in a series of works that the order of the automorphism group of a binary [72,36,16] code does not exceed five. We obtain a parametrization of all self-dual binary codes of length 72 with automorphism of order 4 which can…
Starting from a generalization of a recent result on self-duality we systematically analyze self-dual models. We find a criterion to judge whether a given model is self-dual or not. With this tool we construct some new self-dual pairs,…
We obtain analogues of classical results on automorphism groups of holomorphic fiber bundles, in the setting of group schemes. Also, we establish a lifting property of the connected automorphism group, for torsors under abelian varieties.…
Binary linear codes are constructed from graphs, in particular, by the generator matrix $[I_n|A]$ where $A$ is the adjacency matrix of a graph on $n$ vertices. A combinatorial interpretation of the minimum distance of such codes is given.…
Gabidulin codes, serving as the rank-metric counterpart of Reed-Solomon codes, constitute an important class of maximum rank distance (MRD) codes. However, unlike the fruitful positive results about the list decoding of Reed-Solomon codes,…
The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A constructive proof for reconstructibility of an extended perfect…
In this manuscript, we investigate the automorphism group of a maximal function field with the second largest possible genus over finite field of even characteristic, which is called the Abd\'on--Torres function field. As an application, we…
We study the automorphisms of binary stabilizer codes and states. We prove that they almost always form a solvable group, and thereby shed new light on the fact that there is no universal set of transversal gates. We also determine the…
The study of MDS self-dual codes has attracted lots of attention in recent years. There are many papers on determining existence of $q-$ary MDS self-dual codes for various lengths. There are not existence of $q-$ary MDS self-dual codes of…
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…
Self-dual maximum distance separable codes (self-dual MDS codes) and self-dual near MDS codes are very important in coding theory and practice. Thus, it is interesting to construct self-dual MDS or self-dual near MDS codes. In this paper,…
Automorphic loops are loops in which all inner mappings are automorphisms. A large class of automorphic loops is obtained as follows: Let $m$ be a positive even integer, $G$ an abelian group, and $\alpha$ an automorphism of $G$ that…
In this paper, we determine the covering radius and a class of deep holes for Gabidulin codes with both rank metric and Hamming metric. Moreover, we give a necessary and sufficient condition for deciding whether a word is not a deep hole…
Double negacirculant (DN) codes are the analogues in odd characteristic of double circulant codes. Self-dual DN codes of odd dimension are shown to be consta-dihedral. Exact counting formulae are derived for DN codes. The special class of…
This paper explores extremal self-dual double circulant (DC) codes and linear complementary dual (LCD) codes of arbitrary length over the Galois field $\mathbb F_2$. We establish the sufficient and necessary conditions for DC codes and…
We show that every thick subcategory of the singularity category of a complete intersection ring is self dual. We also prove the analogous statement for thick subcategories of the bounded derived category and give applications to the…
Lind and Schmidt have shown that the homoclinic group of a cyclic $\Z^k$ algebraic dynamical system is isomorphic to the dual of the phase group. We show that this duality result is part of an exact sequence if $k=1$. The exact sequence is…