Two theorems on perfect codes

DOI10.1016/0012-365X(72)90028-3MaRDI QIDQ2556304zbMATH OpenFDO

Authors H. W. jun. Lenstra

Publication date 1972

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(72)90028-3

Mathematics Subject Classification ID

Other types of codes (94B60)

Recommendations

• scientific article; zbMATH DE number 4134101
• Lloyd's theorem for perfect codes
• On perfect codes and related concepts
• The classification of some perfect codes
• scientific article; zbMATH DE number 3985115
• Perfect codes and related structures
• On a property of perfect binary codes
• scientific article; zbMATH DE number 850320
• scientific article; zbMATH DE number 4127218
• On perfect arithmetic codes

Cites work

• scientific article; zbMATH DE number 3307642 (Why is no real title available?)
• scientific article; zbMATH DE number 3334182 (Why is no real title available?)
• Coding theory
• On Group and Nongroup Perfect Codes in q Symbols.
• On the Nonexistence of Perfect Codes over Finite Fields

Cited in

(20)

• Lloyd's theorem for perfect codes
• Asymptotic expansion of the Krawtchouk polynomials and their zeros
• On the non-existence of extended 1-perfect codes and MDS codes
• A generalized Lloyd theorem and mixed perfect codes.
• The non-existence of some perfect codes over non-prime power alphabets
• Algebraic theory of block codes detecting independent errors
• Asymptotic analysis of the Krawtchouk polynomials by the WKB method
• Subgroup Perfect Codes in Cayley Graphs
• On the non-existence of certain perfect mixed codes
• Perfect codes in graphs
• scientific article; zbMATH DE number 4164736 (Why is no real title available?)
• The Riemann-Hilbert approach to global asymptotics of discrete orthogonal polynomials with infinite nodes
• On perfect codes over non prime power alphabets
• Partitions of a vector space
• On perfect codes in the Hamming schemes H(n,q) with q arbitrary
• Global asymptotics of Krawtchouk polynomials -- a Riemann-Hilbert approach
• Mehler-Heine type formulas for the Krawtchouk polynomials
• On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e 3 and q 3
• On subgroup perfect codes in Cayley graphs
• Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\)

This page was built for publication: Two theorems on perfect codes

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