scientific article; zbMATH DE number 3685396

MaRDI QIDQ3880744zbMATH OpenFDO

Authors

Publication date 1979

zbMATH Keywords

classical upper boundsDelsarte's linear programming boundmaximum number of words of length noptimal codesperfect codessurvey

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Linear codes (general theory) (94B05) Theory of error-correcting codes and error-detecting codes (94Bxx)

Recommendations

• Publication:3026904
• scientific article; zbMATH DE number 67082
• scientific article; zbMATH DE number 1188984
• Bounds for binary codes of length less than 25
• Improved upper bounds on sizes of codes

Cited in

(8)

• Good coverings of Hamming spaces with spheres
• Maximal partial packings of Z₂^n with perfect codes
• scientific article; zbMATH DE number 4014606 (Why is no real title available?)
• Some optimal codes have structure
• scientific article; zbMATH DE number 3685402 (Why is no real title available?)
• scientific article; zbMATH DE number 67082 (Why is no real title available?)
• Optimal codes in the Enomoto-Katona space
• Sphere packing

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 Q3880744)