Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\)
From MaRDI portal
Publication:1241419
DOI10.1016/0012-365X(77)90152-2zbMath0365.94017MaRDI QIDQ1241419
Publication date: 1977
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (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\(\geq 3\) and q\(\geq 3\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two theorems on perfect codes
- Perfect codes in graphs
- Four fundamental parameters of a code and their combinatorial significance
- On the Nonexistence of Perfect Codes over Finite Fields
- Rook domains, Latin squares, affine planes, and error-distributing codes
- A survey of perfect codes
- Coding theory
This page was built for publication: Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\)
