Perfect codes in Cartesian products of 2-paths and infinite paths

Publication date 17 January 2006

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/125584, http://www.emis.de/journals/EJC/Volume_12/Abstracts/v12i1r65.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

codewords

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other types of codes (94B60)

Review text

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.

Recommendations

Cited in

(13)

This page was built for publication: Perfect codes in Cartesian products of 2-paths and infinite paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583665)