Classification of 8-divisible binary linear codes with minimum distance 24

12/11/2020
by   Sascha Kurz, et al.
0

We classify 8-divisible binary linear codes with minimum distance 24 and small length. As an application we consider the codes associated to nodal sextics with 65 ordinary double points.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/14/2020

Introducing Three Best Known Goppa Codes

The current best known [239, 21], [240, 21], and [241, 21] binary li...
12/06/2019

Globally optimizing small codes in real projective spaces

For d∈{5,6}, we classify arrangements of d + 2 points in RP^d-1 for whic...
10/04/2021

Sequences of linear codes where the rate times distance grows rapidly

For a linear code C of length n with dimension k and minimum distance d,...
09/11/2018

A note on reducing the computation time for minimum distance and equivalence check of binary linear codes

In this paper we show the usability of the Gray code with constant weigh...
01/29/2018

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

Consider a binary linear code of length N, minimum distance d_min, trans...
03/03/2021

A Study of the Separating Property in Reed-Solomon Codes by Bounding the Minimum Distance

According to their strength, the tracing properties of a code can be cat...
04/07/2020

Exact separation of forbidden-set cuts associated with redundant parity checks of binary linear codes

In recent years, several integer programming (IP) approaches were develo...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.