Pages that link to "Item:Q1241419"

The following pages link to Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\) (Q1241419):

Displaying 2 items.

• Upper bounds for the cardinality of s-distances codes (Q1077373) (← links)
• 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\) (Q1078149) (← links)