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

page 1

page 2

page 3

page 4

research
10/14/2020

Introducing Three Best Known Goppa Codes

The current best known [239, 21], [240, 21], and [241, 21] binary li...
research
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...
research
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...
research
07/31/2023

Acute Semigroups, the Order Bound on the Minimum Distance and the Feng-Rao Improvements

We introduce a new class of numerical semigroups, which we call the clas...
research
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,...
research
05/28/2023

Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes

We present O(m^3) algorithms for specifying the support of minimum-weigh...
research
04/17/2023

Grassmannians of codes

Consider the point line-geometry 𝒫_t(n,k) having as points all the [n,k]...

Please sign up or login with your details

Forgot password? Click here to reset