scientific article; zbMATH DE number 165467

zbMATH Open0799.94014MaRDI QIDQ4033258FDOQ4033258

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

Publication date: 16 May 1993

Title of this publication is not available (Why is that?)

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

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)

Cited In (4)

• Perfect codes in the discrete simplex
• Planar Convex Codes are Decidable
• Title not available (Why is that?)
• 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)