English
Related papers

Related papers: On self-dual MRD codes

200 papers

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…

Information Theory · Computer Science 2017-09-25 Minjia Shi , Hongwei Zhu , Patrick Sole

We characterize the groups isomorphic to full automorphism groups of ordered abelian groups. The result will follow from classical theorems on ordered groups adding an argument from proofs used to realize rings as endomorphism rings of…

Logic · Mathematics 2007-05-23 Rüdiger Göbel , Saharon Shelah

We prove that the automorphism group of the dihedral quandle with n elements is isomorphic to the affine group of the integers mod n, and also obtain the inner automorphism group of this quandle. In [9], automorphism groups of quandles (up…

Group Theory · Mathematics 2014-01-29 M. Elhamdadi , J. MacQuarrie , R. Restrepo

In this work, we study codes generated by elements that come from group matrix rings. We present a matrix construction which we use to generate codes in two different ambient spaces: the matrix ring $M_k(R)$ and the ring $R,$ where $R$ is…

Information Theory · Computer Science 2021-02-02 Steven Dougherty , Adrian Korban , Serap Sahinkaya , Deniz Ustun

We compute the virtual cohomological dimension (VCD) of the group of partially symmetric outer automorphisms of a free group. We use this to obtain new upper and lower bounds on the VCD of the outer automorphism group of a two-dimensional…

Group Theory · Mathematics 2008-04-16 Kai-Uwe Bux , Ruth Charney , Karen Vogtmann

We compute explicitly the automorphism and outer automorphism group of all large-type free-of-infinity Artin groups. Our strategy involves reconstructing the associated Deligne complexes in a purely algebraic manner, i.e. in a way that is…

Group Theory · Mathematics 2024-10-15 Nicolas Vaskou

We give a characterization for the binary linear constant weight codes by using the symmetric difference of the supports of the codewords. This characterization gives a correspondence between the set of binary linear constant weight codes…

Information Theory · Computer Science 2023-04-12 Murat Altunbulak , Fatma Altunbulak Aksu

In this paper, we study self-dual codes over $\mathbb{Z}_2 \times (\mathbb{Z}_2+u\mathbb{Z}_2) $, where $u^2=0$. Three types of self-dual codes are defined. For each type, the possible values $\alpha,\beta$ such that there exists a code…

Information Theory · Computer Science 2016-10-05 Long Yu , Qiong Huang , Hongwei Liu , Xiusheng Liu

We study Reed--Solomon codes over arbitrary fields, inspired by several recent papers dealing with Gabidulin codes over fields of characteristic zero. Over the field of rational numbers, we derive bounds on the coefficient growth during…

Information Theory · Computer Science 2019-07-01 Carmen Sippel , Cornelia Ott , Sven Puchinger , Martin Bossert

In this paper we define and study a family of codes which come close to be MRD codes, so we call them AMRD codes (almost MRD). An AMRD code is a code with rank defect equal to 1. AMRD codes whose duals are AMRD are called dually AMRD.…

Information Theory · Computer Science 2016-12-14 Javier de la Cruz

In this paper, we construct self-dual codes from a construction that involves both block circulant matrices and block quadratic residue circulant matrices. We provide conditions when this construction can yield self-dual codes. We construct…

Rings and Algebras · Mathematics 2020-04-02 Joe Gildea , Abidin Kaya , Rhian Taylor , Alexander Tylyshchak , Bahattin Yildiz

MDS self-dual codes have good algebraic structure, and their parameters are completely determined by the code length. In recent years, the construction of MDS Euclidean self-dual codes with new lengths has become an important issue in…

Information Theory · Computer Science 2025-04-03 Weirong Meng , Weijun Fang , Fang-Wei Fu , Haiyan Zhou , Ziyi Gu

Self-dual double circulant codes of odd dimension are shown to be dihedral in even characteristic and consta-dihedral in odd characteristic. Exact counting formulae are derived for them and used to show they contain families of codes with…

Information Theory · Computer Science 2016-03-03 Adel Alahmadi , Funda Özdemir , Patrick Solé

A classification of quaternary Hermitian self-dual codes of length 20 is given. Using this classification, a classification of extremal quaternary Hermitian self-dual codes of length 22 is also given.

Combinatorics · Mathematics 2012-05-28 Masaaki Harada , Akihiro Munemasa

We study dg-manifolds which are R[2]-bundles over R[1]-bundles over manifolds, we calculate its symmetries, its derived symmetries and we introduce the concept of T-dual dg-manifolds. Within this framework we construct the T-duality map as…

Differential Geometry · Mathematics 2014-05-14 Ernesto Lupercio , Camilo Rengifo , Bernardo Uribe

Two mappings in a finite field, the Frobenius mapping and the cyclic shift mapping, are applied on lines in PG($n,p$) or codes in the Grassmannian, to form automorphisms groups in the Grassmanian and in its codes. These automorphisms are…

Combinatorics · Mathematics 2012-10-23 Tuvi Etzion , Alexander Vardy

Bazzi and Mitter [3] showed that binary dihedral group codes are asymptotically good. In this paper we prove that the dihedral group codes over any finite field with good mathematical properties are asymptotically good. If the…

Information Theory · Computer Science 2021-07-05 Yun Fan , Liren Lin

We define fully irreducible automorphisms of generalized Baumslag-Solitar groups in analogy with fully irreducible automorphisms of free groups. We first obtain a characterization of fully irreducible automorphisms analogous to a condition…

Group Theory · Mathematics 2022-05-19 Chloé Papin

We investigate two classes of extended codes and provide necessary and sufficient conditions for these codes to be non-GRS MDS codes. We also determine the parity check matrices for these codes. Using the connection of MDS codes with arcs…

Information Theory · Computer Science 2025-06-16 Kanat Abdukhalikov , Cunsheng Ding , Gyanendra K. Verma

Previously, self-dual codes have been constructed from weighing matrices, and in particular from conference matrices (skew and symmetric). In this paper, codes constructed from matrices of skew symmetric type whose determinants reach the…

Information Theory · Computer Science 2013-11-13 José Andrés Armario , María Dolores Frau
‹ Prev 1 4 5 6 7 8 10 Next ›