On the nonexistence of unknown perfect 6- and 8-codes in Hamming schemes H(n,q) with q arbitrary

MaRDI QIDQ800889zbMATH OpenFDO

Authors Yiming Hong

Publication date 1984

Published in Osaka Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

perfect codesHamming schemes

Mathematics Subject Classification ID

Other designs, configurations (05B30) Combinatorial codes (94B25)

Recommendations

• On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e 3 and q 3
• scientific article; zbMATH DE number 3499624
• Homogeneity theorems on perfect codes in Hamming schemes and generalized Hamming schemes
• scientific article; zbMATH DE number 2192212
• On the Nonexistence of Perfect Codes in the Johnson Scheme

Cited in

(11)

• On the non-existence fo perfect double Hamming-error-correcting codes on \(q=11\) symbols
• Alphabet-almost-simple 2-neighbour-transitive codes
• \(e\)-perfect codes
• Homogeneity theorems on perfect codes in Hamming schemes and generalized Hamming schemes
• The non-existence of some perfect codes over non-prime power alphabets
• Distance-regular graphs of Hamming type
• scientific article; zbMATH DE number 3499624 (Why is no real title available?)
• On the non-existence of certain perfect mixed codes
• On the non-existence of perfect double hamming-error-correcting codes on q = 8 and q = 9 symbols
• On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e 3 and q 3
• Upper bounds for the cardinality of s-distances codes

This page was built for publication: On the nonexistence of unknown perfect 6- and 8-codes in Hamming schemes H(n,q) with q arbitrary

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800889)