On perfect codes in the Hamming schemes H(n,q) with q arbitrary

DOI10.1016/0097-3165(77)90079-6MaRDI QIDQ1237695zbMATHOpenAlexFDO

Authors Eiichi Bannai

Publication date 1977

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(77)90079-6

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Cites work

• scientific article; zbMATH DE number 3468637 (Why is no real title available?)
• scientific article; zbMATH DE number 3335652 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• On elementary calculus and the Good formula
• On the Nonexistence of Perfect Codes over Finite Fields
• Perfect codes in graphs
• Two theorems on perfect codes

Cited in

(9)

• Cyclotomic graphs and perfect codes
• On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e\(\geq 3\) and q\(\geq 3\)
• Perfect codes in Cayley graphs
• Perfect codes in vertex-transitive graphs
• Distance-regular graphs of Hamming type
• On non-normal subgroup perfect codes
• Total perfect codes in Cayley graphs
• On subgroup perfect codes in Cayley graphs
• On tight spherical designs

This page was built for publication: On perfect codes in the 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 Q1237695)