2009 |
56 | EE | Paul Dorbec,
Sylvain Gravier,
Iiro S. Honkala,
Michel Mollard:
Weighted codes in Lee metrics.
Des. Codes Cryptography 52(2): 209-218 (2009) |
2007 |
55 | EE | Irène Charon,
Iiro S. Honkala,
Olivier Hudry,
Antoine Lobstein:
Structural Properties of Twin-Free Graphs.
Electr. J. Comb. 14(1): (2007) |
54 | EE | Iiro S. Honkala,
Tero Laihonen:
On identifying codes that are robust against edge changes.
Inf. Comput. 205(7): 1078-1095 (2007) |
53 | 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 |
52 | EE | Iiro S. Honkala:
An optimal locating-dominating set in the infinite triangular grid.
Discrete Mathematics 306(21): 2670-2681 (2006) |
51 | EE | Iiro S. Honkala,
Tero Laihonen:
On locating-dominating sets in infinite grids.
Eur. J. Comb. 27(2): 218-227 (2006) |
50 | EE | Iiro S. Honkala,
Mark G. Karpovsky,
Lev B. Levitin:
On robust and dynamic identifying codes.
IEEE Transactions on Information Theory 52(2): 599-612 (2006) |
49 | EE | Iiro S. Honkala:
A family of optimal identifying codes in Z2.
J. Comb. Theory, Ser. A 113(8): 1760-1763 (2006) |
2004 |
48 | EE | Irène Charon,
Iiro S. Honkala,
Olivier Hudry,
Antoine Lobstein:
The minimum density of an identifying code in the king lattice.
Discrete Mathematics 276(1-3): 95-109 (2004) |
47 | 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) |
46 | EE | Iiro S. Honkala,
Tero Laihonen:
On identifying codes in the hexagonal mesh.
Inf. Process. Lett. 89(1): 9-14 (2004) |
45 | EE | Iiro S. Honkala,
Tero Laihonen:
On identification in the triangular grid.
J. Comb. Theory, Ser. B 91(1): 67-86 (2004) |
44 | EE | Iiro S. Honkala,
Tero Laihonen:
On identifying codes in the triangular and square grids.
SIAM J. Comput. 33(2): 304-312 (2004) |
2003 |
43 | 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) |
42 | EE | Iiro S. Honkala,
Mark G. Karpovsky,
Simon Litsyn:
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori.
Discrete Applied Mathematics 129(2-3): 409-419 (2003) |
41 | EE | Iiro S. Honkala,
Tero Laihonen:
Codes for Identification in the King Lattice.
Graphs and Combinatorics 19(4): 505-516 (2003) |
40 | EE | Iiro S. Honkala,
Antoine Lobstein:
On Identification in ZZ2 Using Translates of Given Patterns.
J. UCS 9(10): 1204-1219 (2003) |
2002 |
39 | EE | Iiro S. Honkala,
Antoine Lobstein:
On the complexity of the identification problem in Hamming spaces.
Acta Inf. 38(11/12): 839-845 (2002) |
38 | EE | Iiro S. Honkala,
Tero Laihonen,
Sanna M. Ranto:
On strongly identifying codes.
Discrete Mathematics 254(1-3): 191-205 (2002) |
37 | | 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) |
36 | EE | Iiro S. Honkala,
Antoine Lobstein:
On Identifying Codes in Binary Hamming Spaces.
J. Comb. Theory, Ser. A 99(2): 232-243 (2002) |
35 | EE | Iiro S. Honkala,
Antoine Lobstein:
On the Density of Identifying Codes in the Square Lattice.
J. Comb. Theory, Ser. B 85(2): 297-306 (2002) |
34 | EE | Iiro S. Honkala,
Andrew Klapper:
Multicovering Bounds from Relative Covering Radii.
SIAM J. Discrete Math. 15(2): 228-234 (2002) |
2001 |
33 | EE | Iiro S. Honkala,
Mark G. Karpovsky,
Simon Litsyn:
On the Identification of Vertices and Edges Using Cycles.
AAECC 2001: 308-314 |
32 | | Iiro S. Honkala,
Andrew Klapper:
Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers.
Des. Codes Cryptography 23(2): 131-146 (2001) |
31 | | 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) |
30 | EE | Uri Blass,
Iiro S. Honkala,
Simon Litsyn:
Bounds on identifying codes.
Discrete Mathematics 241(1-3): 119-128 (2001) |
29 | EE | Irène Charon,
Iiro S. Honkala,
Olivier Hudry,
Antoine Lobstein:
General Bounds for Identifying Codes in Some Infinite Regular Graphs.
Electr. J. Comb. 8(1): (2001) |
28 | EE | Iiro S. Honkala,
Tero Laihonen,
Sanna M. Ranto:
Codes for Strong Identification.
Electronic Notes in Discrete Mathematics 6: 262-270 (2001) |
27 | EE | Gérard D. Cohen,
Iiro S. Honkala,
Antoine Lobstein,
Gilles Zémor:
On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals.
IEEE Trans. Computers 50(2): 174-176 (2001) |
2000 |
26 | EE | Gérard D. Cohen,
Iiro S. Honkala,
Antoine Lobstein,
Gilles Zémor:
Bounds for Codes Identifying Vertices in the Hexagonal Grid.
SIAM J. Discrete Math. 13(4): 492-504 (2000) |
1999 |
25 | | Uri Blass,
Iiro S. Honkala,
Simon Litsyn:
On tHe Size of Identifying Codes.
AAECC 1999: 142-147 |
24 | EE | Gérard D. Cohen,
Iiro S. Honkala,
Antoine Lobstein,
Gilles Zémor:
New Bounds for Codes Identifying Vertices in Graphs.
Electr. J. Comb. 6: (1999) |
23 | | 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) |
22 | | 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) |
1998 |
21 | | Iiro S. Honkala:
Combinatorial lower bounds on binary codes with covering radius one.
Ars Comb. 50: (1998) |
1997 |
20 | 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) |
19 | | Gérard D. Cohen,
Iiro S. Honkala,
Simon Litsyn,
Patrick Solé:
Long packing and covering codes.
IEEE Transactions on Information Theory 43(5): 1617-1619 (1997) |
1996 |
18 | EE | Iiro S. Honkala,
Yrjö Kaipainen,
Aimo Tietäväinen:
Long Binary Narrow-Sense BCH Codes Are Normal.
Appl. Algebra Eng. Commun. Comput. 8(1): 49-55 (1996) |
1995 |
17 | | Iiro S. Honkala,
Simon Litsyn,
Aimo Tietäväinen:
On Algebraic Methods in Covering Radius Problems.
AAECC 1995: 21-32 |
16 | | Gérard D. Cohen,
Iiro S. Honkala,
Simon Litsyn,
H. F. Mattson Jr.:
Weighted coverings and packings.
IEEE Transactions on Information Theory 41(6): 1856-1867 (1995) |
15 | EE | Heikki O. Hämäläinen,
Iiro S. Honkala,
Simon Litsyn,
Patric R. J. Östergård:
Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points.
SIAM J. Discrete Math. 8(2): 196-207 (1995) |
1994 |
14 | EE | Iiro S. Honkala:
On (q, 1)-subnormal q-ary Covering Codes.
Discrete Applied Mathematics 52(3): 213-221 (1994) |
13 | EE | Iiro S. Honkala:
On the normality of multiple covering codes.
Discrete Mathematics 125(1-3): 229-239 (1994) |
1993 |
12 | | G. Fang,
Henk C. A. van Tilborg,
Feng-Wen Sun,
Iiro S. Honkala:
Some Features of Binary Block Codes for Correcting Asymmetric Errors.
AAECC 1993: 105-120 |
11 | | Iiro S. Honkala:
A Lower Bound on Binary Codes with Covering Radius One.
Algebraic Coding 1993: 34-37 |
10 | | Heikki O. Hämäläinen,
Iiro S. Honkala,
Markku K. Kaikkonen,
Simon Litsyn:
Bounds for Binary Multiple Covering Codes.
Des. Codes Cryptography 3(3): 251-275 (1993) |
9 | | Tuvi Etzion,
Gadi Greenberg,
Iiro S. Honkala:
Normal and abnormal codes.
IEEE Transactions on Information Theory 39(4): 1453- (1993) |
1992 |
8 | EE | Iiro S. Honkala:
On lengthening of covering codes.
Discrete Mathematics 106-107: 291-295 (1992) |
1991 |
7 | EE | Iiro S. Honkala:
All binary codes with covering radius one are subnormal.
Discrete Mathematics 94(3): 229-232 (1991) |
6 | | Iiro S. Honkala:
Modified bounds for coveting codes.
IEEE Transactions on Information Theory 37(2): 351- (1991) |
5 | | Iiro S. Honkala,
Heikki O. Hämäläinen:
Bounds for abnormal binary codes with covering radius one.
IEEE Transactions on Information Theory 37(2): 372- (1991) |
4 | | Iiro S. Honkala:
On (k, t) -subnormal covering codes.
IEEE Transactions on Information Theory 37(4): 1203- (1991) |
1990 |
3 | | Wende Chen,
Iiro S. Honkala:
Lower bounds for q-ary covering codes.
IEEE Transactions on Information Theory 36(3): 664- (1990) |
1988 |
2 | | Iiro S. Honkala:
Lower bounds for binary covering codes.
IEEE Transactions on Information Theory 34(2): 326- (1988) |
1 | | Iiro S. Honkala,
Heikki O. Hämäläinen:
A new construction for covering codes.
IEEE Transactions on Information Theory 34(5): 1343- (1988) |