Golay Codes

Golay Code is a perfect binary or ternary linear error-correcting code that achieves the highest possible error-correcting capability for its length and redundancy, distinguished by its unique ability to correct up to three errors in the binary case and two errors in the ternary case within a 23- or 24-symbol codeword.

217

Publications

9.2K

Citations

446

Authors

195

Institutions

Publications per year

2017–2026

27

Variants

Golay Code

Authors

446

  1. AN
    Andrzej Nowicki

    Institute of Fundamental Technological Research, Poland

    6 publications · 151 citations

    6

    h-index

  2. JJ
    Jonathan Jedwab

    Simon Fraser University, Canada

    6 publications · 444 citations

    6

    h-index

  3. AV
    Alexander Vardy

    University of California San Diego, United States

    5 publications · 335 citations

    5

    h-index

  4. MA
    Marcelo A. Soto

    École Polytechnique Fédérale de Lausanne, Switzerland

    4 publications · 185 citations

    4

    h-index

  5. GD
    G. David Forney

    Motorola (United States), United States

    4 publications · 908 citations

    4

    h-index

1–5 of 446

Venues

  1. IEEE Transactions on Information Theory

    48 publications · 3.4K citations

    32

    h-index

  2. IEEE Communications Letters

    7 publications · 137 citations

    7

    h-index

  3. Journal of Combinatorial Theory Series A

    6 publications · 288 citations

    6

    h-index

  4. 5

    h-index

  5. Optics Express

    5 publications · 243 citations

    5

    h-index

1–5