Covering Codes

Cover restrains" is a theoretical construct in coding theory that belongs to the class of error-correcting codes and is distinguished by its property of ensuring that every vector in the ambient space lies within a specified Hamming distance of at least one codeword, thereby providing complete coverage of the space with respect to a given radius.

104

Publications

3.9K

Citations

133

Authors

92

Institutions

Publications per year

2017–2026

4

Variants

Covering Code

Authors

133

  1. SL
    Simon Litsyn

    Tel Aviv University, Israel

    8 publications · 138 citations

    9

    h-index

  2. IH
    Iiro Honkala

    University of Turku, Finland

    9 publications · 223 citations

    9

    h-index

  3. PR
    Patric R. J. Östergård

    Aalto University, Finland

    7 publications · 119 citations

    8

    h-index

  4. NJ
    N. J. A. Sloane

    Mathematical Sciences Research Institute, United States

    7 publications · 581 citations

    7

    h-index

  5. AA
    Alexander A. Davydov

    Institute for Information Transmission Problems, Russia

    6 publications · 160 citations

    6

    h-index

1–5 of 133

Venues

  1. IEEE Transactions on Information Theory

    56 publications · 2.3K citations

    25

    h-index

  2. Journal of Combinatorial Theory Series A

    8 publications · 314 citations

    8

    h-index

  3. Designs Codes and Cryptography

    5 publications · 88 citations

    7

    h-index

  4. Discrete Mathematics

    5 publications · 90 citations

    5

    h-index

  5. Journal of Combinatorial Designs

    JCD · 5 publications · 288 citations

    5

    h-index

1–5