Nonexistence of nontrivial perfect codes in case q=p^r₁p^s₂, e 3

DOI10.1016/0012-365X(77)90152-2MaRDI QIDQ1241419zbMATH OpenFDO

Authors Aimo Tietäväinen

Publication date 1977

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(77)90152-2

Mathematics Subject Classification ID

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

Cites work

• A survey of perfect codes
• Coding theory
• Four fundamental parameters of a code and their combinatorial significance
• scientific article; zbMATH DE number 3455135 (Why is no real title available?)
• scientific article; zbMATH DE number 3468637 (Why is no real title available?)
• scientific article; zbMATH DE number 3511977 (Why is no real title available?)
• On the Nonexistence of Perfect Codes over Finite Fields
• Perfect codes in graphs
• Rook domains, Latin squares, affine planes, and error-distributing codes
• Two theorems on perfect codes

Cited in

(2)

• Upper bounds for the cardinality of s-distances codes
• On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e 3 and q 3

This page was built for publication: Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\)

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