Open Source
On the MDS conjecture in even characteristic
arXiv math.IT0 views
arXiv:2610.28208v1 Announce Type: cross Abstract: We prove that every nontrivial linear $[n,k]$ maximum distance separable (MDS) code over a finite field $\F_q$ of characteristic two satisfies $n\le q+1$, except in dimensions $k=3$ and $k=q-1$, where $n\le q+2$. This resolves the linear MDS conjecture in even characteristic.
Source：https://arxiv.org/abs/2610.28208PreviousAlmost entropic matroids and $(k,L)$-systemsNextTiming and Reliability Limits of Position-Assisted UWB Multicast Audio
Related posts
'America hates data centers' — New data highlights public sentiment
0Tom's Hardware
Anime Expeditions Codes (November 2026)
0FOSS Bytes
Karpathy built HackerTube in 2 hours. I rebuilt it in the open and measured it
0dev.to AI
Show HN: Poinky – Claude Code you talk to, that sees your screen
0Hacker News Show
Show HN: DeskAccess – Open-source remote access for Raspberry Pi
0Hacker News Show
Show HN: The Public Eye – Agentic search for congressional bill legibility
0Hacker News Show