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
Successive Convexification in Learned World Models for Safe Offline Planning
0arXiv cs.RO
GOOSELoc: A Multimodal Benchmark for Ground-to-Aerial Localization in Unstructured Off-Road Terrain
0arXiv cs.RO
Linglong Agent Service: A Runtime for Centralized Agent Reasoning and Distributed Execution
0arXiv cs.RO
WiTac: Wrist-Informed Tactile Representations for Contact-Rich Manipulation
0arXiv cs.RO

Backup imutável de RDS com cofre logicamente isolado: o que PCI DSS e ISO 27001 pedem e como provar
0dev.to AWS
Show HN: NetDiag self-hosted network inventory and diagnostics
0Hacker News Show