Perfect single error-correcting codes in the Johnson Scheme
classification
🧮 math.CO
keywords
codesperfectsinglethereerror-correctingjohnsonschemeconjectured
read the original abstract
Delsarte conjectured in 1973 that there are no nontrivial pefect codes in the Johnson scheme. Etzion and Schwartz recently showed that perfect codes must be k-regular for large k, and used this to show that there are no perfect codes correcting single errors in J(n,w) for n <= 50000. In this paper we show that there are no perfect single error-correcting codes for n <= 2^250.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.