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
Parents
217
On the uniqueness of the Golay codes
Vera Pless · Journal of Combinatorial Theory · 1968 · 208 citations
1–5 of 217
446
Institute of Fundamental Technological Research, Poland
6 publications · 151 citations
6
h-index
6
h-index
5
h-index
4
h-index
4
h-index
1–5 of 446
195

Tel Aviv University
Tel Aviv, Israel
8 h-index
15 publications
585 citations

University of Waterloo
Waterloo, Canada
6 h-index
8 publications
333 citations
Simon Fraser University
Burnaby, Canada
6 h-index
7 publications
533 citations
Institute of Fundamental Technological Research
Warsaw, Poland
6 h-index
21 publications
568 citations
University of Southern California
Los Angeles, United States
5 h-index
8 publications
381 citations
Defence Science and Technology Group
Canberra, Australia
5 h-index
5 publications
177 citations

The University of Melbourne
Melbourne, Australia
5 h-index
7 publications
204 citations
AT&T (United States)
Bedminster, United States
4 h-index
4 publications
222 citations
1–8 of 195
48 publications · 3.4K citations
32
h-index
7 publications · 137 citations
7
h-index
6 publications · 288 citations
6
h-index
5 publications · 427 citations
5
h-index
5 publications · 243 citations
5
h-index
1–5