Perfect codes in Cartesian products of 2-paths and infinite paths (Q2583665)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2248137
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect codes in Cartesian products of 2-paths and infinite paths |
scientific article; zbMATH DE number 2248137 |
Statements
Perfect codes in Cartesian products of 2-paths and infinite paths (English)
0 references
17 January 2006
0 references
A perfect code is a set of codewords such that disjoint spheres of a given radius with respect to a metric centered around the codewords cover the ambient space. The authors generalize the standard definition to the Cartesian product of the graph of the hypercube of dimension \(k\) and infinite grid. They produce both existence and non-existence results for these codes.
0 references
codewords
0 references
0.9100711941719056
0 references
0.8935548663139343
0 references
0.8584409356117249
0 references
0.8493440747261047
0 references
