The [46,9,20]_2 code is unique

06/06/2019
by   Sascha Kurz, et al.
0

The minimum distance of all binary linear codes with dimension at most eight is known. The smallest open case for dimension nine is length n=46 with known bounds 19< d< 20. Here we present a [46,9,20]_2 code and show its uniqueness. Interestingly enough, this unique optimal code is asymmetric, i.e., it has a trivial automorphism group. Additionally, we show the non-existence of [47,10,20]_2 and [85,9,40]_2 codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/30/2022

Optimal possibly nonlinear 3-PIR codes of small size

First, we state a generalization of the minimum-distance bound for PIR c...
research
10/14/2020

Introducing Three Best Known Goppa Codes

The current best known [239, 21], [240, 21], and [241, 21] binary li...
research
02/05/2020

Embedding linear codes into self-orthogonal codes and their optimal minimum distances

We obtain a characterization on self-orthogonality for a given binary li...
research
02/04/2023

Bounds on Binary Niederreiter-Rosenbloom-Tsfasman LCD codes

Linear complementary dual codes (LCD codes) are codes whose intersection...
research
04/18/2022

Linear codes using simplicial complexes

Certain simplicial complexes are used to construct a subset D of 𝔽_2^n^m...
research
11/21/2022

Evolutionary Strategies for the Design of Binary Linear Codes

The design of binary error-correcting codes is a challenging optimizatio...
research
07/17/2019

Quantum Codes of Maximal Distance and Highly Entangled Subspaces

We present new bounds on the existence of quantum maximum distance separ...

Please sign up or login with your details

Forgot password? Click here to reset