scientific article; zbMATH DE number 503183

MaRDI QIDQ4279504zbMATH OpenFDO

Authors Vladimir Levenshtein

Publication date 17 February 1994

zbMATH Keywords

boundscodesminimal distancepolynomial metric spaces

Mathematics Subject Classification ID

Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Bounds on codes (94B65)

Recommendations

• An extremum problem for polynomials and bounds for codes with given distance and diameter
• On upper bounds for code distance and covering radius of designs in polynomial metric spaces
• scientific article; zbMATH DE number 2077080
• scientific article; zbMATH DE number 1284419

Cited in

(13)

• Designs as maximum codes in polynomial metric spaces
• An extremum problem for polynomials related to codes and designs
• On upper bounds for code distance and covering radius of designs in polynomial metric spaces
• scientific article; zbMATH DE number 3856983 (Why is no real title available?)
• scientific article; zbMATH DE number 3890761 (Why is no real title available?)
• scientific article; zbMATH DE number 4047568 (Why is no real title available?)
• scientific article; zbMATH DE number 1188989 (Why is no real title available?)
• scientific article; zbMATH DE number 1222360 (Why is no real title available?)
• scientific article; zbMATH DE number 1284419 (Why is no real title available?)
• Codes and designs
• Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
• scientific article; zbMATH DE number 4183333 (Why is no real title available?)
• An extremum problem for polynomials and bounds for codes with given distance and diameter

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