Two theorems on perfect codes
From MaRDI portal
Publication:2556304
DOI10.1016/0012-365X(72)90028-3zbMath0248.94017MaRDI QIDQ2556304
Publication date: 1972
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
On the non-existence of extended 1-perfect codes and MDS 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\), Asymptotic expansion of the Krawtchouk polynomials and their zeros, Global asymptotics of Krawtchouk polynomials -- a Riemann-Hilbert approach, Algebraic theory of block codes detecting independent errors, Partitions of a vector space, Subgroup Perfect Codes in Cayley Graphs, On subgroup perfect codes in Cayley graphs, Asymptotic analysis of the Krawtchouk polynomials by the WKB method, THE RIEMANN–HILBERT APPROACH TO GLOBAL ASYMPTOTICS OF DISCRETE ORTHOGONAL POLYNOMIALS WITH INFINITE NODES, The non-existence of some perfect codes over non-prime power alphabets, On perfect codes in the Hamming schemes H(n,q) with q arbitrary, Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\), Lloyd's theorem for perfect codes, Mehler-Heine type formulas for the Krawtchouk polynomials, On the non-existence of certain perfect mixed codes, Perfect codes in graphs
Cites Work
