On the Nonexistence of Perfect Codes in the Johnson Scheme
From MaRDI portal
Publication:4881286
Recommendations
- On perfect codes in the Johnson scheme
- Perfect Single Error-Correcting Codes in the Johnson Scheme
- On the Nonexistence of Perfect Codes over Finite Fields
- scientific article; zbMATH DE number 2192212
- scientific article; zbMATH DE number 3477029
- On the non-existence of certain perfect mixed codes
- On the failing cases of the Johnson bound for error-correcting codes
- scientific article; zbMATH DE number 3385528
- scientific article; zbMATH DE number 3499625
- On the Non - Existence of Perfect Codes with Rank Distance
Cited in
(18)- On the nonbinary Johnson scheme
- Homogeneity theorems on perfect codes in Hamming schemes and generalized Hamming schemes
- Codes and anticodes in the Grassman graph
- Cyclotomic graphs and perfect codes
- A new approach for examining \(q\)-Steiner systems
- 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
- scientific article; zbMATH DE number 4177073 (Why is no real title available?)
- Configuration distribution and designs of codes in the Johnson scheme
- Perfect Constant-Weight Codes
- Perfect Single Error-Correcting Codes in the Johnson Scheme
- scientific article; zbMATH DE number 2192212 (Why is no real title available?)
- scientific article; zbMATH DE number 966482 (Why is no real title available?)
- On completely regular codes
- Large cycles in generalized Johnson graphs
- Weakly resolvable block designs and nonbinary codes meeting the Johnson bound
- On the nonexistence of unknown perfect 6- and 8-codes in Hamming schemes H(n,q) with q arbitrary
This page was built for publication: On the Nonexistence of Perfect Codes in the Johnson Scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4881286)
