scientific article; zbMATH DE number 3835913

MaRDI QIDQ3043047zbMATH OpenFDO

Authors

Publication date 1983

zbMATH Keywords

Kravcuk polynomialsLloyd's theoremperfect codes

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Combinatorial codes (94B25)

Cited in

(8)

• 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 3 and q 3
• Maximal partial spreads and two-weight codes
• Minimal linear codes over finite fields
• Minimal linear codes from Maiorana-McFarland functions
• Distance-regular graphs of Hamming type
• Combinatorial designs and perfect codes
• Zeros of generalized Krawtchouk polynomials

This page was built for publication:

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