Optimal self-orthogonal binary linear codes
math.CO, cs.DM, cs.IT, math.IT
Submitted: 2026-10-29
Updated: 2026-11-17
Comments: 39 pages; comments more than welcome
Code: https://github.com/yygotm/tab=repositories
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- Shortest self-orthogonal embeddings of binary linear codes
- The generalized Griesmer and antiGriesmer bounds
- A proof of Ward's conjecture on Griesmer codes
- Classification of 8-divisible binary linear codes with minimum distance 24
- Divisible Codes
- Additive codes attaining the Griesmer bound
- Linear codes for $b$-symbol read channels attaining the Griesmer bound
- Constructions of binary self-orthogonal singly-even minimal linear codes violating the Aschikhmin-Barg condition with few weights
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality