Open Source
Optimal self-orthogonal binary linear codes
arXiv math.IT0 views
arXiv:2610.39870v2 Announce Type: replace-cross Abstract: We complete the determination of the minimum possible length of eight-dimensional binary self-orthogonal codes with given minimum distance. For dimension nine we give exact values and bounds for minimum distance at most $64$. By exploiting the geometric reformulation of linear codes as multisets of points, we fully redo the classification for dimension at most seven in a simplified and computer-free manner. As a by-product we prove the non-existence of $[93,9,44]_2$ codes and show several divisibility results for putative optimal nine-dimensional binary codes.
Source:https://arxiv.org/abs/2610.39870PreviousNon-isomorphic graphs have distinct vertex-Ramsey classesNextEvaluating the Evaluation of Music Generation Models with Generative Psychometrics
Related posts
Oriko CLI – Create your CV in the terminal with builtin Agent support
0Hacker News New
From 181 bytes: nixpkgs' full-source bootstrap
0Hacker News New
Show HN: Fufu – an opinionated Git client inspired by Jujutsu
0Hacker News New
Show HN: Pbc – a CLI for any PocketBase instance
0Hacker News Show

A Link You Can Just Open
0dev.to
Your coding agent's tests pass. It still edited files you never asked about.
0dev.to OpenSource