| 2008 |
|---|
| 5 | EE | Gerzson Kéri:
The covering radius of extreme binary 2-surjective codes.
Des. Codes Cryptography 46(2): 191-198 (2008) |
| 4 | EE | Gerzson Kéri,
Patric R. J. Östergård:
On the minimum size of binary codes with length 2 R + 4 and covering radius R.
Des. Codes Cryptography 48(2): 165-169 (2008) |
| 2007 |
|---|
| 3 | EE | Gerzson Kéri,
Patric R. J. Östergård:
Further results on the covering radius of small codes.
Discrete Mathematics 307(1): 69-77 (2007) |
| 2005 |
|---|
| 2 | EE | Gerzson Kéri,
Patric R. J. Östergård:
Bounds for Covering Codes over Large Alphabets.
Des. Codes Cryptography 37(1): 45-60 (2005) |
| 2004 |
|---|
| 1 | EE | Gerzson Kéri,
Ákos Kisvölcsey:
On Computing the Hamming Distance.
Acta Cybern. 16(3): 443-449 (2004) |
