English
Related papers

Related papers: Involutory permutation automorphisms of binary lin…

200 papers

In this work, we propose a modified four circulant construction for self-dual codes and a bordered version of the construction using the properties of \lambda-circulant and \lambda-reverse circulant matrices. By using the constructions on…

Information Theory · Computer Science 2016-02-24 Abidin Kaya , Bahattin Yildiz , Abdullah Paşa

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…

Information Theory · Computer Science 2024-02-05 Stefka Bouyuklieva

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…

Information Theory · Computer Science 2014-05-30 Tao Zhang , Jerod Michel , Tao Feng , Gennian Ge

In this note we report the classification of all symmetric 2-(36,15,6) designs that admit an automorphism of order 2 and their incidence matrices generate an extremal ternary self-dual code. It is shown that up to isomorphism, there exists…

Combinatorics · Mathematics 2022-09-28 Sanja Rukavina , Vladimir D. Tonchev

In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…

Information Theory · Computer Science 2021-11-11 Martino Borello , Wolfgang Willems

Two isometry groups of combinatorial codes are described: the group of automorphisms and the group of monomial automorphisms, which is the group of those automorphisms that extend to monomial maps. Unlike the case of classical linear codes,…

Information Theory · Computer Science 2018-07-25 Serhii Dyshko

The existence of an extremal code of length 72 is a long-standing open problem. Let C be a putative extremal code of length 72 and suppose that C has an automorphism g of order 6. We show that C, as an F_2<g>-module, is the direct sum of…

Information Theory · Computer Science 2012-09-26 Martino Borello

We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…

Information Theory · Computer Science 2012-07-16 Kenza Guenda , T. Aaron Gulliver

In this work, we generalize the four circulant construction for self-dual codes. By applying the constructions over the alphabets F_2, F_2 + uF_2, F_4+uF_4, we were able to obtain extremal binary self-dual codes of lengths 40, 64 including…

Combinatorics · Mathematics 2019-12-30 Joe Gildea , Abidin Kaya , Bahattin Yildiz

In this paper we obtain at least 61 new singly even (Type I) binary [72,36,12] self-dual codes as a quasi-cyclic codes with m=2 (tailbitting convolutional codes) and at least 13 new doubly even (Type II) binary [72,36,12] self-dual codes by…

Information Theory · Computer Science 2017-05-17 Alexandre Zhdanov

In this note, we demonstrate that every binary doubly even self-dual code of length $40$ can be realized as the residue code of some extremal Type II $\mathbb{Z}_4$-code. As a consequence, it is shown that there are at least $94356$…

Combinatorics · Mathematics 2017-06-13 Masaaki Harada

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 work, connected cubic planar bipartite graphs and related binary self-dual codes are studied. Binary self-dual codes of length 16 are obtained by face-vertex incidence matrices of these graphs. By considering their lifts to the ring…

Combinatorics · Mathematics 2016-10-04 Abidin Kaya

The purpose of this paper is to complete the classification of binary self-dual [48,24,10] codes with an automorphism of odd prime order. We prove that if there is a self-dual [48, 24, 10] code with an automorphism of type p-(c,f) with p…

Information Theory · Computer Science 2012-01-23 Stefka Bouyuklieva , Nikolay Yankov , Jon-Lark Kim

For a unital ring $S$, an $S$-linear quasigroup is a unital $S$-module, with automorphisms $\rho$ and $\lambda$ giving a (nonassociative) multiplication $x\cdot y=x^\rho+y^\lambda$. If $S$ is the field of complex numbers, then ordinary…

Group Theory · Mathematics 2019-10-23 Jonathan D. H. Smith , Stefanie G. Wang

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…

Combinatorics · Mathematics 2018-06-15 Nikolay Yankov , Radka Russeva , Emine Karatash

The projective special linear group $\PSL_2(n)$ is $2$-transitive for all primes $n$ and $3$-homogeneous for $n \equiv 3 \pmod{4}$ on the set $\{0,1, \cdots, n-1, \infty\}$. It is known that the extended odd-like quadratic residue codes are…

Information Theory · Computer Science 2017-04-06 Cunsheng Ding , Hao Liu , Vladimir D. Tonchev

We construct a $40$-dimensional extremal Type II lattice not having any subsets consisting of $40$ orthogonal minimal vectors, and determine the automorphism group. This lattice gives an example different from the $16470$ lattices…

Number Theory · Mathematics 2019-05-28 Norifumi Ojiro

We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these…

Combinatorics · Mathematics 2008-01-09 Lars Eirik Danielsen , Matthew G. Parker

In this paper we obtain a number of [70,35,12] singly even self-dual codes as a quasi-cyclic codes with m=2 (tailbitting convolutional codes). One of them is the first known code with parameters Beta=140 Gamma=0. All codes are not pure…

Information Theory · Computer Science 2017-04-06 Alexandre Zhdanov