Advertisement

On some mixed covering codes of small length

  • E. Kolev
  • I. Landgev
Covering Codes
Part of the Lecture Notes in Computer Science book series (LNCS, volume 781)

Abstract

We find some new lower bounds for the cardinality of mixed covering codes having length n=6, 7, or 8 and covering radius up to 3. Some exact values for these numbers are also computed.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    H.O.Hämäläinen, S.Rankinen, Upper bounds for football pool problems and mixed covering codes, J. Combin. Theory Ser.A56 (1991), 84–95.Google Scholar
  2. [2]
    I.Honkala, Lower bounds for binary covering codes, IEEE Trans. Inform. theory34 (1988), 326–329.Google Scholar
  3. [3]
    J.H. van Lint, Jr., G.J.M. van Wee, Generalized bounds on binary/ternary mixed packing and covering codes, J. Combin. Theory Ser.A57(1991), 130–134.Google Scholar
  4. [4]
    G.J.M. van Wee, Improved sphere bounds on the covering radius of codes, J. Combin. Theory Ser.A (1991), 117–129.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • E. Kolev
    • 1
  • I. Landgev
    • 1
  1. 1.Institute of MathematicsBulgarian Academy of SciencesSofiaBulgaria

Personalised recommendations