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

Best Free AI Image Generators That Run on Your Own Computer or Phone in 2026 (No Credits, No Uploads)
0dev.to OpenSource
The Dangers of Non-Self-Fixed Architecture Technical Debt and Its Impact on Time-to-Fix
0arXiv cs.SE
ViBench 2.0: A Benchmark for Long-Horizon Software Building
0arXiv cs.SE
AI-Driven SaaS Platform Integration: AI Express for Unified Generative AI Services with Pay-As-You-Go Credit Systems and Scalable Microservice Architecture
0arXiv cs.SE
Online Draft Co-Training for Speculative Decoding in Large-Scale, Long-Context RL Post-Training
0arXiv cs.DC
On solid angles and simplex shape measures
0arXiv cs.NA