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

Sascha Kurz

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.06163 v1 pith:IMIPZ5NG submitted 2020-12-11 cs.IT math.COmath.IT

Sascha Kurz This is my paper · ORCID

classification cs.ITmath.COmath.IT

keywords codesbinarydistancedivisiblelinearminimumapplicationassociated

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Nodal surfaces in $\mathbb{P}^3$ and coding theory
math.CO 2025-05 conditional novelty 4.0 of 10

The binary linear code associated to any sextic surface in P^3 with 65 nodes is unique: it is the [65,12,{24,32,40}] code of the Barth sextic.

Pith tools