Iiro S. Honkala

	2012
62		Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau: Locally identifying colourings for graphs with given maximum degree. Discrete Mathematics 312(10): 1832-1837 (2012)
	2011
61		Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau: Locally identifying colourings for graphs with given maximum degree CoRR abs/1108.2769: (2011)
	2010
60		Iiro S. Honkala: An Optimal Strongly Identifying Code in the Infinite Triangular Grid. Electr. J. Comb. 17(1): (2010)
	2009
59		Paul Dorbec, Sylvain Gravier, Iiro S. Honkala, Michel Mollard: Weighted codes in Lee metrics. Des. Codes Cryptography 52(2): 209-218 (2009)
58		Paul Dorbec, Sylvain Gravier, Iiro S. Honkala, Michel Mollard: Weighted perfect codes in Lee metric. Electronic Notes in Discrete Mathematics 34: 477-481 (2009)
57		Iiro S. Honkala: On r-locating-dominating sets in paths. Eur. J. Comb. 30(4): 1022-1025 (2009)
	2008
56		Iiro S. Honkala, Tero Laihonen: On Identifying Codes in the King Grid that are Robust Against Edge Deletions. Electr. J. Comb. 15(1): (2008)
	2007
55		Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein: Structural Properties of Twin-Free Graphs. Electr. J. Comb. 14(1): (2007)
54		Iiro S. Honkala, Tero Laihonen: On identifying codes that are robust against edge changes. Inf. Comput. 205(7): 1078-1095 (2007)
53		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		Iiro S. Honkala: An optimal locating-dominating set in the infinite triangular grid. Discrete Mathematics 306(21): 2670-2681 (2006)
51		Iiro S. Honkala, Tero Laihonen: On locating-dominating sets in infinite grids. Eur. J. Comb. 27(2): 218-227 (2006)
50		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		Iiro S. Honkala: A family of optimal identifying codes in Z2. J. Comb. Theory, Ser. A 113(8): 1760-1763 (2006)
	2004
48		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		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		Iiro S. Honkala, Tero Laihonen: On identifying codes in the hexagonal mesh. Inf. Process. Lett. 89(1): 9-14 (2004)
45		Iiro S. Honkala, Tero Laihonen: On identification in the triangular grid. J. Comb. Theory, Ser. B 91(1): 67-86 (2004)
44		Iiro S. Honkala, Tero Laihonen: On identifying codes in the triangular and square grids. SIAM J. Comput. 33(2): 304-312 (2004)
	2003
43		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		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		Iiro S. Honkala, Tero Laihonen: Codes for Identification in the King Lattice. Graphs and Combinatorics 19(4): 505-516 (2003)
40		Iiro S. Honkala, Antoine Lobstein: On Identification in ZZ2 Using Translates of Given Patterns. J. UCS 9(10): 1204-1219 (2003)
	2002
39		Iiro S. Honkala, Antoine Lobstein: On the complexity of the identification problem in Hamming spaces. Acta Inf. 38(11/12): 839-845 (2002)
38		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		Iiro S. Honkala, Antoine Lobstein: On Identifying Codes in Binary Hamming Spaces. J. Comb. Theory, Ser. A 99(2): 232-243 (2002)
35		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		Iiro S. Honkala, Andrew Klapper: Multicovering Bounds from Relative Covering Radii. SIAM J. Discrete Math. 15(2): 228-234 (2002)
	2001
33		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		Uri Blass, Iiro S. Honkala, Simon Litsyn: Bounds on identifying codes. Discrete Mathematics 241(1-3): 119-128 (2001)
29		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		Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto: Codes for Strong Identification. Electronic Notes in Discrete Mathematics 6: 262-270 (2001)
27		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		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		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		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		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		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		Iiro S. Honkala: On (q, 1)-subnormal q-ary Covering Codes. Discrete Applied Mathematics 52(3): 213-221 (1994)
13		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-1456 (1993)
	1992
8		Iiro S. Honkala: On lengthening of covering codes. Discrete Mathematics 106-107: 291-295 (1992)
	1991
7		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-365 (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-375 (1991)
4		Iiro S. Honkala: On (k, t) -subnormal covering codes. IEEE Transactions on Information Theory 37(4): 1203-1206 (1991)
	1990
3		Wende Chen, Iiro S. Honkala: Lower bounds for q-ary covering codes. IEEE Transactions on Information Theory 36(3): 664-671 (1990)
	1988
2		Iiro S. Honkala: Lower bounds for binary covering codes. IEEE Transactions on Information Theory 34(2): 326-329 (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-1344 (1988)

Coauthor Index

1	Alexei E. Ashikhmin	[23]
2	Uri Blass	[25] [30]
3	Irène Charon	[29] [48] [55]
4	Wende Chen	[3]
5	Gérard D. Cohen	[16] [19] [24] [26] [27]
6	Paul Dorbec	[58] [59]
7	Tuvi Etzion	[9]
8	G. Fang	[12]
9	Florent Foucaud	[61] [62]
10	Sylvain Gravier	[58] [59]
11	Gadi Greenberg	[9]
12	Heikki O. Hämäläinen	[1] [5] [10] [15]
13	Olivier Hudry	[29] [48] [55]
14	Markku K. Kaikkonen	[10]
15	Yrjö Kaipainen	[18]
16	Mark G. Karpovsky	[33] [42] [50]
17	Andrew Klapper	[32] [34]
18	Tero Laihonen	[20] [22] [23] [28] [31] [37] [38] [41] [43] [44] [45] [46] [47] [51] [53] [54] [56] [61] [62]
19	Lev B. Levitin	[50]
20	Simon Litsyn	[10] [15] [16] [17] [19] [20] [23] [25] [30] [33] [42]
21	Antoine Lobstein	[24] [26] [27] [29] [35] [36] [39] [40] [48] [55]
22	H. F. Mattson Jr.	[16]
23	Michel Mollard	[58] [59]
24	Patric R. J. Östergård	[15]
25	Aline Parreau	[61] [62]
26	Guillem Perarnau	[61] [62]
27	Sanna M. Ranto	[28] [31] [37] [38] [47]
28	Patrick Solé	[19]
29	Feng-Wen Sun	[12]
30	Aimo Tietäväinen	[17] [18]
31	Henk C. A. van Tilborg	[12]
32	Gilles Zémor	[24] [26] [27]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page