The following pages link to Two theorems on perfect codes (Q2556304):
Displaying 18 items.
- On the non-existence of certain perfect mixed codes (Q753797) (← links)
- Asymptotic analysis of the Krawtchouk polynomials by the WKB method (Q953253) (← 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)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- Partitions of a vector space (Q1145192) (← links)
- On perfect codes in the Hamming schemes H(n,q) with q arbitrary (Q1237695) (← links)
- Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\) (Q1241419) (← links)
- Lloyd's theorem for perfect codes (Q1243264) (← links)
- Asymptotic expansion of the Krawtchouk polynomials and their zeros (Q1880512) (← links)
- On the non-existence of extended 1-perfect codes and MDS codes (Q2120824) (← links)
- On subgroup perfect codes in Cayley graphs (Q2225434) (← links)
- The non-existence of some perfect codes over non-prime power alphabets (Q2275366) (← links)
- Mehler-Heine type formulas for the Krawtchouk polynomials (Q2304876) (← links)
- Perfect codes in graphs (Q2559208) (← links)
- Global asymptotics of Krawtchouk polynomials -- a Riemann-Hilbert approach (Q2641571) (← links)
- THE RIEMANN–HILBERT APPROACH TO GLOBAL ASYMPTOTICS OF DISCRETE ORTHOGONAL POLYNOMIALS WITH INFINITE NODES (Q3580190) (← links)
- A generalized Lloyd theorem and mixed perfect codes. (Q4081127) (← links)
- Subgroup Perfect Codes in Cayley Graphs (Q5128515) (← links)
