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
Open-source Minecraft launcher. Speed and local
0dev.to GitHub
How to choose where to launch your side project
0dev.to Discuss
Pathology Randomization for Synthetic Priors and Zero-Shot Detection
0arXiv eess.IV

Devin.ai.. Stop Leaving Free Money on the Table: Why Every Developer Must Hammer Devin.ai in This Global 10-Day Window
0dev.to OpenSource
TaF-Foundation: Wrench-Grounded Cross-Sensor Tactile Representations
0arXiv cs.RO
SG-ODOM: Event-Driven Proprioceptive State Estimation with Stability-Gated Contact Updates for Legged Robots
0arXiv cs.RO