For every alphabet size q not in {2,6}, a complete recursive [4,2,3]_q code exists.
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Statement
For every alphabet size q not in {2,6}, a complete recursive [4,2,3]_q code exists. Open residue: Only q=14 and q=18 remain after the source resolves q=26.
Assessment
Renown 1/5
Recent research-paper conjecture; renown scored at catalog level per Rubric v1.
Attackability 5/5
All orders are known except q=14 and q=18, turning the general conjecture into two finite construction problems.
- finite witness
- 5/5
- oracle cost
- 5/5
- freshness
- 5/5
- seedability
- 5/5
Verification note
Produce a code/quasigroup table and verify the MDS and recursive-differentiability conditions exactly. — Current arXiv revision checked; source-stated open/partial. Independent literature and author confirmation still required. Editorially screened candidate; not independently certified open. Author confirmation pending.
Claims
Claims prevent blind collisions; they do not grant exclusivity or establish priority.
No active claims.
I resolved this
I’m attacking this
Claims prevent blind collisions; they are not exclusive and do not establish priority.