Skip to main content
Log in

Weighted codes in Lee metrics

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Perfect weighted coverings of radius one have been often studied in the Hamming metric. In this paper, we study these codes in the Lee metric. To simplify the notation, we use a slightly different description, yet equivalent. Given two integers a and b, an (a, b)-code is a set of vertices such that vertices in the code have a neighbours in the code and other vertices have b neighbours in the code. An (a, b)-code is exactly a perfect weighted covering of radius one with weight \({(\frac{b-a}{b},\frac{1}{b})}\). In this paper, we prove results of existence as well as of non-existence for (a, b)-codes on the multidimensional grid graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Axenovich M.A. (2003) On multiple coverings of the infinite rectangular grid with balls of constant radius. Discrete Math. 268: 31–48

    Article  MATH  MathSciNet  Google Scholar 

  2. Biggs N. (1973) Perfect codes in graphs. J. Combin. Theory Ser. B 15: 289–296

    Article  MATH  MathSciNet  Google Scholar 

  3. Cohen G., Honkala I., Litsyn S., Lobstein A. (1997) Covering Codes. North Holland Mathematical Library, Amsterdam

    MATH  Google Scholar 

  4. Cohen G.D., Honkala I.S., Litsyn S., Mattson H.F. Jr. (1995) Weighted coverings and packings. IEEE Trans. Inform. Theory 41: 1856–1967

    Article  MATH  MathSciNet  Google Scholar 

  5. Dorbec P., Mollard M.: Perfect codes in cartesian products of 2-paths and infinite paths. Electron. J. Combin. 12, #R65 (2005).

    Google Scholar 

  6. Golomb S.W., Welch L.R.: Algebraic coding and the Lee metric. In: Proc. Sympos. Math. Res. Center, Madison, WI, pp. 175–194. John Wiley, New York (1968).

  7. Golomb S.W., Welch L.R. (1970) Perfect codes in the Lee metric and the packing of polyominoes. SIAM J. Appl. Math. 18: 302–317

    Article  MATH  MathSciNet  Google Scholar 

  8. Gravier S., Mollard M., Payan C. (1999) Variations on tilings in Manhattan metric. Geom. Dedicata 76(3): 265–274

    Article  MATH  MathSciNet  Google Scholar 

  9. Telle J.A. (1994) Complexity of domination-type problems in graphs. Nordic J. Comput. 1: 157–171

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Paul Dorbec.

Additional information

Communicated by D. Ghinelli.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dorbec, P., Gravier, S., Honkala, I. et al. Weighted codes in Lee metrics. Des. Codes Cryptogr. 52, 209–218 (2009). https://doi.org/10.1007/s10623-009-9277-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-009-9277-z

Keywords

Mathematics Subject Classifications (2000)