Hamming Codes

Hamming Codes is a class of linear error-correcting codes that enable the detection and correction of single-bit errors in transmitted data by introducing parity bits at positions determined by powers of two, thereby achieving minimum Hamming distance of three.

516

Publications

31.2K

Citations

1.1K

Authors

495

Institutions

Publications per year

2017–2026

108

Authors

1.1K

  1. SL
    Simon Litsyn

    Tel Aviv University, Israel

    6 publications · 224 citations

    7

    h-index

  2. AB
    Alexander Barg

    University of Maryland, College Park, United States

    7 publications · 677 citations

    7

    h-index

  3. CC
    Chin‐Chen Chang

    Feng Chia University, Taiwan

    7 publications · 290 citations

    7

    h-index

  4. DK
    Dhiraj K. Pradhan

    University of Bristol, United Kingdom

    7 publications · 243 citations

    7

    h-index

  5. TE
    Tuvi Etzion

    Technion – Israel Institute of Technology, Israel

    6 publications · 198 citations

    6

    h-index

1–5 of 1.1K

Venues

  1. IEEE Transactions on Information Theory

    91 publications · 6.2K citations

    38

    h-index

  2. IEEE Transactions on Communications

    17 publications · 744 citations

    15

    h-index

  3. Designs Codes and Cryptography

    13 publications · 313 citations

    12

    h-index

  4. Discrete Mathematics

    11 publications · 266 citations

    10

    h-index

  5. IEEE Access

    7 publications · 140 citations

    8

    h-index

1–5