| 2001 |
|---|
| 8 | EE | Uri Blass,
Iiro S. Honkala,
Simon Litsyn:
Bounds on identifying codes.
Discrete Mathematics 241(1-3): 119-128 (2001) |
| 7 | | Patric R. J. Östergård,
Uri Blass:
On the size of optimal binary codes of length 9 and covering radius 1.
IEEE Transactions on Information Theory 47(6): 2556-2557 (2001) |
| 1999 |
|---|
| 6 | | Uri Blass,
Iiro S. Honkala,
Simon Litsyn:
On tHe Size of Identifying Codes.
AAECC 1999: 142-147 |
| 5 | | Uri Blass,
Simon Litsyn:
The smallest covering code of length 8 and radius 2 has 12 words.
Ars Comb. 52: (1999) |
| 1998 |
|---|
| 4 | | Uri Blass,
Simon Litsyn:
Several new lower bounds for football pool systems.
Ars Comb. 50: (1998) |
| 3 | | Uri Blass,
Simon Litsyn:
Several New Lower Bounds on the Size of Codes with Covering Radius One.
IEEE Transactions on Information Theory 44(5): 1998-2002 (1998) |
| 2 | EE | Uri Blass,
Aviezri S. Fraenkel,
Romina Guelman:
How Far Can Nim in Disguise Be Stretched?
J. Comb. Theory, Ser. A 84(2): 145-156 (1998) |
| 1990 |
|---|
| 1 | | Uri Blass,
Aviezri S. Fraenkel:
The Sprague-Grundy Function for Wythoff's Game.
Theor. Comput. Sci. 75(3): 311-333 (1990) |
