| 2008 |
|---|
| 10 | EE | Geoffrey Exoo,
Tero Laihonen,
Sanna M. Ranto:
New bounds on binary identifying codes.
Discrete Applied Mathematics 156(12): 2250-2263 (2008) |
| 2007 |
|---|
| 9 | EE | Geoffrey Exoo,
Tero Laihonen,
Sanna M. Ranto:
Improved Upper Bounds on Binary Identifying Codes.
IEEE Transactions on Information Theory 53(11): 4255-4260 (2007) |
| 2004 |
|---|
| 8 | EE | Iiro S. Honkala,
Tero Laihonen,
Sanna M. Ranto:
On Locating-Dominating Codes in Binary Hamming Spaces.
Discrete Mathematics & Theoretical Computer Science 6(2): 265-282 (2004) |
| 2003 |
|---|
| 7 | | Sanna M. Ranto:
Optimal linear identifying codes.
IEEE Transactions on Information Theory 49(6): 1544-1547 (2003) |
| 2002 |
|---|
| 6 | | Tero Laihonen,
Sanna M. Ranto:
Families of optimal codes for strong identification.
Discrete Applied Mathematics 121(1-3): 203-213 (2002) |
| 5 | EE | Iiro S. Honkala,
Tero Laihonen,
Sanna M. Ranto:
On strongly identifying codes.
Discrete Mathematics 254(1-3): 191-205 (2002) |
| 4 | | Sanna M. Ranto,
Iiro S. Honkala,
Tero Laihonen:
Two families of optimal identifying codes in binary Hamming spaces.
IEEE Transactions on Information Theory 48(5): 1200-1203 (2002) |
| 2001 |
|---|
| 3 | EE | Tero Laihonen,
Sanna M. Ranto:
Codes Identifying Sets of Vertices.
AAECC 2001: 82-91 |
| 2 | | Iiro S. Honkala,
Tero Laihonen,
Sanna M. Ranto:
On Codes Identifying Sets of Vertices in Hamming Spaces.
Des. Codes Cryptography 24(2): 193-204 (2001) |
| 1 | EE | Iiro S. Honkala,
Tero Laihonen,
Sanna M. Ranto:
Codes for Strong Identification.
Electronic Notes in Discrete Mathematics 6: 262-270 (2001) |
