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

Onboarding Instrumentation: What to Actually Log Before You Redesign the Flow
0dev.to UX
Iceberg vs Parquet: do you need a table format?
0dev.to Data

Open Source Didn't Ban AI Code. 83% of Its AI Policies Allow It, With One Catch
0dev.to Git
Orbit: A High-Performance Terminal Workspace & System Monitor in Rust with WASM Plugins
0dev.to Rust

Forecasting the U.S. Senate with Prediction Markets and Monte Carlo Simulations
0dev.to AI
VoiceStudio: open-source, fully-local ElevenLabs alternative
0Hacker News New