Open Source
On $t$-designs supported by self-orthogonal codes
arXiv math.IT0 views
arXiv:2610.41545v1 Announce Type: cross Abstract: We study self-orthogonal $t$-$(v,k,\lambda)$ designs satisfying the condition that the codes generated by the designs are self-orthogonal codes whose codewords of minimum weight $k$ correspond to the blocks. A classification of such designs is given under the conditions that $t\geq \lfloor k/4\rfloor+1\geq2$ and $t \le 11$. This yields a classification of self-orthogonal codes of minimum weight $k$ whose codewords of minimum weight form a $t$-design under the same conditions.
Source:https://arxiv.org/abs/2610.41545PreviousSparse descent subspace-Newton thresholding algorithm for sparse optimization problemsNextOn approximate support versions of Donoho--Stark uncertainty principles for $k$-Hadamard operators
Related posts
How we simulated a 0.78s cross-border payment loop over a Satellite Mesh.
0dev.to Security

Placement In Every Trace
0dev.to DevOps
The Psychology of Seduction: How to Become Impossible to Ignore – Robert Greene
0Hacker News New
Musk's Colossus DC cluster – what's the storage situation?
0Hacker News New
How to get a transcript from any video link or audio file (2026)
0dev.to Tutorial
SimForcing: Distilling Simulation Motion Priors into Real-Domain Robot World Models
0arXiv cs.RO