Weighted codes in Lee metrics (Q735023): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1261013
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Iiro S. Honkala / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-009-9277-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078676496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiple coverings of the infinite rectangular grid with balls of constant radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted coverings and packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes in Cartesian products of 2-paths and infinite paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Codes in the Lee Metric and the Packing of Polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on tilings in the Manhattan metric / rank
 
Normal rank

Revision as of 00:57, 2 July 2024

scientific article
Language Label Description Also known as
English
Weighted codes in Lee metrics
scientific article

    Statements

    Weighted codes in Lee metrics (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 October 2009
    0 references
    The authors discuss perfect weighted coverings of radius one with the Manhattan metric in the \(n\)-dimensional infinite grid. This problem can also be stated as a graph coloring problem, as follows. Determine all possible pairs \((a,b)\), such that the \(n\)-dimensional infinite grid can be colored with two colors, where each vertex with the first color is adjacent to \(a\) vertices of the second color and each vertex with the second color is adjacent to \(b\) vertices of the first color. Independently, \textit{D. B. Khoroshilova} [Diskretn. Anal. Issled. Oper. 16, No. 1, 80-92, 97 (2009)] has shown that a sufficient condition for a desired coloring to exist is that \(n \geq (a+b-\gcd(a,b))/2\). In the current work, the constructions are presented in many theorems, so it is difficult to see whether this is actually also the result obtained here; anyway, tabulated results for \(n=9\) hint that this might be the case. Some nonexistence results are also obtained.
    0 references
    coloring
    0 references
    grid graph
    0 references
    Manhattan metric
    0 references
    weighted code
    0 references
    graph coloring problem
    0 references
    infinite grid
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references