| 2008 |
|---|
| 28 | EE | Geoffrey Exoo,
Tero Laihonen,
Sanna M. Ranto:
New bounds on binary identifying codes.
Discrete Applied Mathematics 156(12): 2250-2263 (2008) |
| 27 | EE | Tero Laihonen:
On cages admitting identifying codes.
Eur. J. Comb. 29(3): 737-741 (2008) |
| 2007 |
|---|
| 26 | 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) |
| 25 | EE | Iiro S. Honkala,
Tero Laihonen:
On identifying codes that are robust against edge changes.
Inf. Comput. 205(7): 1078-1095 (2007) |
| 24 | EE | Iiro S. Honkala,
Tero Laihonen:
On a new class of identifying codes in graphs.
Inf. Process. Lett. 102(2-3): 92-98 (2007) |
| 2006 |
|---|
| 23 | EE | Tero Laihonen:
On robust identification in the square and king grids.
Discrete Applied Mathematics 154(17): 2499-2510 (2006) |
| 22 | EE | Iiro S. Honkala,
Tero Laihonen:
On locating-dominating sets in infinite grids.
Eur. J. Comb. 27(2): 218-227 (2006) |
| 2005 |
|---|
| 21 | EE | Tero Laihonen:
On Optimal Edge-Robust and Vertex-Robust (1, leql)-Identifying Codes.
SIAM J. Discrete Math. 18(4): 825-834 (2005) |
| 2004 |
|---|
| 20 | 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) |
| 19 | EE | Iiro S. Honkala,
Tero Laihonen:
On identifying codes in the hexagonal mesh.
Inf. Process. Lett. 89(1): 9-14 (2004) |
| 18 | EE | Iiro S. Honkala,
Tero Laihonen:
On identification in the triangular grid.
J. Comb. Theory, Ser. B 91(1): 67-86 (2004) |
| 17 | EE | Iiro S. Honkala,
Tero Laihonen:
On identifying codes in the triangular and square grids.
SIAM J. Comput. 33(2): 304-312 (2004) |
| 2003 |
|---|
| 16 | EE | Iiro S. Honkala,
Tero Laihonen:
On the Identification of Sets of Points in the Square Lattice.
Discrete & Computational Geometry 29(1): 139-152 (2003) |
| 15 | EE | Iiro S. Honkala,
Tero Laihonen:
Codes for Identification in the King Lattice.
Graphs and Combinatorics 19(4): 505-516 (2003) |
| 2002 |
|---|
| 14 | | Tero Laihonen,
Sanna M. Ranto:
Families of optimal codes for strong identification.
Discrete Applied Mathematics 121(1-3): 203-213 (2002) |
| 13 | EE | Iiro S. Honkala,
Tero Laihonen,
Sanna M. Ranto:
On strongly identifying codes.
Discrete Mathematics 254(1-3): 191-205 (2002) |
| 12 | EE | Tero Laihonen:
Optimal Codes for Strong Identification.
Eur. J. Comb. 23(3): 307-313 (2002) |
| 11 | | Tero Laihonen:
Sequences of optimal identifying codes.
IEEE Transactions on Information Theory 48(3): 774-776 (2002) |
| 10 | | 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 |
|---|
| 9 | EE | Tero Laihonen,
Sanna M. Ranto:
Codes Identifying Sets of Vertices.
AAECC 2001: 82-91 |
| 8 | | 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) |
| 7 | EE | Iiro S. Honkala,
Tero Laihonen,
Sanna M. Ranto:
Codes for Strong Identification.
Electronic Notes in Discrete Mathematics 6: 262-270 (2001) |
| 1999 |
|---|
| 6 | | Alexei E. Ashikhmin,
Iiro S. Honkala,
Tero Laihonen,
Simon Litsyn:
On relations between covering radius and dual distance.
IEEE Transactions on Information Theory 45(6): 1808-1816 (1999) |
| 5 | | Iiro S. Honkala,
Tero Laihonen:
The probability of undetected error can have several local maxima.
IEEE Transactions on Information Theory 45(7): 2537-2539 (1999) |
| 4 | EE | Tero Laihonen,
Simon Litsyn:
New Bounds On Covering Radius as a Function of Dual Distance.
SIAM J. Discrete Math. 12(2): 243-251 (1999) |
| 1998 |
|---|
| 3 | | Tero Laihonen,
Simon Litsyn:
On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes.
Des. Codes Cryptography 14(1): 71-80 (1998) |
| 1997 |
|---|
| 2 | EE | Iiro S. Honkala,
Tero Laihonen,
Simon Litsyn:
On Covering Radius and Discrete Chebyshev Polynomials.
Appl. Algebra Eng. Commun. Comput. 8(5): 395-401 (1997) |
| 1 | EE | Cunsheng Ding,
Tero Laihonen,
Ari Renvall:
Linear Multisecret-Sharing Schemes and Error-Correcting Codes.
J. UCS 3(9): 1023-1036 (1997) |
