Open Source
A proof of Ward's conjecture on Griesmer codes
arXiv math.IT0 views
arXiv:2610.29275v1 Announce Type: cross Abstract: Let $C$ be an $[n,k,d]_q$ Griesmer code, where $q=p^f$ with $p$ prime, and write $e=\nu_p(d)$. Ward conjectured that $C$ is $p^{\max\{0,e-f+1\}}$-divisible. In this paper, we prove this conjecture.
Source：https://arxiv.org/abs/2610.29275PreviousPQ-Vault: Provably Quantum-Safe Asset Custody for Unmodified EthereumNextGeneralization Bounds via Vector-Valued $L_p$ Correlation $V_\alpha$
Related posts
A fresh wave of cyberattacks has hit Europe’s supermarket refrigerators, destroying food across countries
0TechCrunch
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