scientific article; zbMATH DE number 165467

MaRDI QIDQ4033258zbMATH OpenFDO

Authors Zh. K. Abdurakhmanov, A. K. Pulatov

Publication date 16 May 1993

zbMATH Keywords

convex polytopeperfect codes

Mathematics Subject Classification ID

Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• A Combinatorial Construction of Perfect Codes
• Perfect codes in the discrete simplex
• Constructions for perfect mixed codes and other covering codes
• scientific article; zbMATH DE number 503208
• On a class of abstract polytopes constructed from binary codes
• On the reconstruction of perfect codes
• Constructions of algebraic-geometry codes
• Perfect codes in Euclidean lattices
• scientific article; zbMATH DE number 1789834
• On the geometric constructions of optimal linear codes

Cited in

(4)

• Perfect codes in the discrete simplex
• Planar Convex Codes are Decidable
• scientific article; zbMATH DE number 825115 (Why is no real title available?)
• On a class of abstract polytopes constructed from binary codes

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