Perfect Single Error-Correcting Codes in the Johnson Scheme
From MaRDI portal
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.
Recommendations
Cited in
(14)- On the failing cases of the Johnson bound for error-correcting codes
- Minimum supports of eigenfunctions of Johnson graphs
- Completely regular codes in Johnson and Grassmann graphs with small covering radii
- Perfect codes in the discrete simplex
- On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure
- On perfect codes in the Johnson scheme
- Perfect codes in Doob graphs
- Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
- Perfect Constant-Weight Codes
- On the Nonexistence of Perfect Codes in the Johnson Scheme
- On perfect 2-colorings of Johnson graphs \(J(v, 3)\)
- scientific article; zbMATH DE number 2192212 (Why is no real title available?)
- On completely regular codes
- On the regularity of perfect 2-colorings of the Johnson graph
This page was built for publication: Perfect Single Error-Correcting Codes in the Johnson Scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548130)
