scientific article; zbMATH DE number 4135866

MaRDI QIDQ3469036zbMATH OpenFDO

Authors B. I. Belov, V. P. Sandimirov

Publication date 1988

zbMATH Keywords

cardinalityHamming upper boundKrawtchouk polynomialslinear binary codesprojective codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Recommendations

• Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
• New binary linear codes
• Some new bounds for q-ary linear block codes
• Improved upper bounds on sizes of codes
• The linear programming bound for binary linear codes

Cited in

(2)

• Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
• New upper bounds for the size of permutation codes via linear programming

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