Skip to main content

On Weighted Coverings and Packings with Diameter One

  • Chapter
Eurocode ’92

Part of the book series: International Centre for Mechanical Sciences ((CISM,volume 339))

Abstract

We discuss a connection between weighted coverings and packings, study perfect weighted coverings (PWC) with diameter one and determine all the pairs (m0,m1) for which there exists a perfect q-ary linear (m0,m1)-covering.

Résumé

Nous discutons des liens entre recouvrements et pavages pondérés, étudions les recouvrements pondérés parfaits de diamètre 1 et déterminons toutes les paires (m0,m1) pour lesquelles des (m0,m1) recouvrements q-aires parfaits linéaires existent.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cohen, G.D., S.N. Litsyn and H.F. Mattson, Jr.: Binary perfect weighted coverings, in: Sequences ‘81, Positano, 17–22 June 1991, Springer-Verlag Lecture Notes in Computer Science,to appear.

    Google Scholar 

  2. Cohen, G.D., S.N. Litsyn and H.F. Mattson, Jr.: On perfect weighted coverings with small radius, in: First French-Soviet Workshop in Algebraic Coding, Paris, 22–24 July 1991, Springer-Verlag Lecture Notes in Computer Science 573, Berlin–Heidelberg, 1992, 32–41.

    Google Scholar 

  3. Etzion, T. and G. Greenberg: Constructions for perfect mixed codes and other covering codes, IEEE Trans. Inform. Theory, to appear.

    Google Scholar 

  4. Hämäläinen, H.O., I.S. Honkala, M.K. Kaikkonen and S.N. Litsyn: Bounds for binary multiple coverings, Designs, Codes and Cryptography, to appear.

    Google Scholar 

  5. Hämäläinen, H.O., I.S. Honkala and S.N. Litsyn, Bounds for binary codes that are multiple coverings of the farthest-off points, in preparation.

    Google Scholar 

  6. Li, D. and W. Chen: New lower bounds for binary covering codes, IEEE Trans. Inform. Theory, submitted.

    Google Scholar 

  7. Östergard, P.R.J.: Further results on (k,t)-subnormal covering codes, IEEE Trans. Inform. Theory 38 (1992) 206–210.

    Article  MATH  MathSciNet  Google Scholar 

  8. van Wee, G.J.M., G.D. Cohen and S.N. Litsyn: A note on perfect multiple coverings of Hamming spaces, IEEE Trans. Inform. Theory 37 (1991) 678–682.

    Article  MATH  Google Scholar 

  9. Zhang, Z., Linear inequalities for covering codes: part I–pair covering inequalities, IEEE Trans. Inform. Theory 37 (1991) 573–582.

    Article  MATH  MathSciNet  Google Scholar 

  10. Zhang, Z. and C. Lo, Linear inequalities for covering codes: part II–triple covering inequalities,“ IEEE Trans. Inform. Theory 38 (1992) 1648–1662.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Wien

About this chapter

Cite this chapter

Cohen, G.D., Honkala, I.S., Litsyn, S.N. (1993). On Weighted Coverings and Packings with Diameter One. In: Camion, P., Charpin, P., Harari, S. (eds) Eurocode ’92. International Centre for Mechanical Sciences, vol 339. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2786-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-2786-5_4

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82519-8

  • Online ISBN: 978-3-7091-2786-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics