scientific article; zbMATH DE number 165467
The authors define some perfect codes on the vertices of a convex polytope. They introduce the following definition: A non-empty subset \(C\) of the vertices \(V\) of a given convex polytope \(M\) is said to be a perfect \((N,d)\)-code on the polytope \(M\) if: \(\rho(v_ 1, v_ 2)\geq d\) holds for every vertices \(v_ 1\) and \(v_ 2\) of \(C\) where \(\rho(v_ 1, v_ 2)\) denotes the number of edges of a shortest path from \(v_ 1\) to \(v_ 2\) (\(v_ 1\neq v_ 2\)). The system of those balls (in the space of vertices with the above metric) the centres of which are elements of \(C\) and which have common radius \(t= d/2\) covers the set \(V\). The paper contains some simple constructions of perfect \((N,d)\)-codes when \(d\geq 2\) and some interesting (but not too hard) statements connected with this definition.
- 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
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)
