English
Related papers

Related papers: Solution of the [72, 36,16] Problem

200 papers

This research announcement describes in very rough terms methods and a computer language under development, which can be used to prove the nonexistence of binary linear codes. Over a hundred new results have been obtained by the author. For…

Combinatorics · Mathematics 2007-07-16 David B. Jaffe

The structure of binary self-dual codes invariant under the action of a cyclic group of order $pq$ for odd primes $p\neq q$ is considered. As an application we prove the nonexistence of an extremal self-dual $[96, 48, 20]$ code with an…

Information Theory · Computer Science 2016-05-03 Stefka Bouyuklieva , Wolfgang Willems , Nikolay Yankov

Using integer linear programming and table-lookups we prove that there is no binary linear $[1988, 12, 992]$ code. As a by-product, the non-existence of binary linear codes with the parameters $[324, 10, 160]$, $[356, 10, 176]$,…

Information Theory · Computer Science 2025-10-02 Michael Kiermaier , Alfred Wassermann , Johannes Zwanzger

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…

Combinatorics · Mathematics 2014-06-10 Vassil Yorgov , Daniel Yorgov

In this paper, we introduce and investigate the neighborhood of binary self-dual codes. We prove that there is no better Type I code than the best Type II code of the same length. Further, we give some new necessary conditions for the…

Information Theory · Computer Science 2023-01-18 Carolin Hannusch , S. Roland Major

In this work, we define three composite matrices derived from group rings. We employ these composite matrices to create generator matrices of the form [In | {\Omega}(v)], where In is the identity matrix and {\Omega}(v) is a composite matrix…

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

With the help of a computer, we prove the assertion made in the title.

Combinatorics · Mathematics 2014-06-06 Dragomir Z. Djokovic , Ilias S. Kotsireas

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

A self-dual binary linear code is called Type I code if it has singly-even codewords, i.e.~it has codewords with weight divisible by $2.$ The purpose of this paper is to investigate interesting properties of Type I codes of different…

Information Theory · Computer Science 2021-10-19 Carolin Hannusch , Roland S. Major

A computer calculation with Magma shows that there is no extremal self-dual binary code C of length 72 that has an automorphism group containing D10, Z3xZ3, or Z7. Combining this with the known results in the literature one obtains that…

Information Theory · Computer Science 2012-03-14 Thomas Feulner , Gabriele Nebe

A new [48,16,16] optimal linear binary block code is given. To get this code a general construction is used which is also described in this paper. The construction of this new code settles an conjecture mentioned in a 2008 paper by Janosov…

Information Theory · Computer Science 2009-12-22 Axel Kohnert

Let $C$ be an extremal self-dual binary code of length 72 and $g\in \Aut(C) $ be an automorphism of order 2. We show that $C$ is a free $\F_2<g>$ module and use this to exclude certain subgroups of order 8 of $\Aut (C)$. We also show that…

Information Theory · Computer Science 2011-12-01 Gabriele Nebe

This note presents a short proof of Euler's 36 officer conjecture. This implies that there is no affine plane of order $6$, but we also give a direct proof.

Combinatorics · Mathematics 2019-07-02 Harold N. Ward

In this paper, a virus optimization algorithm, which is one of the metaheuristic optimization technique, is employed for the first time to the problem of finding extremal binary self-dual codes. We present a number of generator matrices of…

Information Theory · Computer Science 2021-03-16 Adrian Korban , Serap Sahinkaya , Deniz Ustun

A complete classification of binary self-dual codes of length 36 is given.

Combinatorics · Mathematics 2012-11-13 Masaaki Harada , Akihiro Munemasa

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

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

In this paper, we show that an extremal Type II $\ZZ_{2k}$-code of length $n$ dose not exist for all sufficiently large $n$ when $k=2,3,4,5,6$.

Combinatorics · Mathematics 2012-06-29 Tsuyoshi Miezaki

We show that for every length of form $4^k-1$, there exists a binary $1$-perfect code that does not include any Preparata-like code.

Information Theory · Computer Science 2019-08-29 Denis S. Krotov , Anastasia Yu. Vasil'eva

All codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact…

Information Theory · Computer Science 2016-11-18 Iliya Bouyukliev , Erik Jakobsson
‹ Prev 1 2 3 10 Next ›