## Publications by Iiro Honkala

### 1a. Monograph

1. Gérard Cohen, Iiro Honkala, Simon Litsyn and Antoine Lobstein: Covering Codes. Elsevier. xxii + 542 pages, North-Holland Mathematical Library 54, 1997. To go to Elsevier for a list of contents, a brief description and ordering details, click here. For errata, click here.

### 1b. Book chapters

2. Iiro Honkala and Patric Östergård: Applications in code design. Invited chapter in: Local Search in Combinatorial Optimization (eds. E. H. L. Aarts and J. K. Lenstra), Wiley, 1997, pp. 441-456.
3. Iiro Honkala and Aimo Tietäväinen: Codes and number theory. Invited chapter in: Handbook of Coding Theory (eds. V. S. Pless and W. C. Huffman), 1998, pp. 1141-1194.

### 2. Refereed journal papers

4. Iiro Honkala, Heikki Hämäläinen, Markku Kaikkonen: A modification of the Zinoviev lower bound for constant weight codes, Discrete Applied Mathematics 11 (1985) 307-310.
5. Iiro Honkala: Some optimal constant weight codes, Ars Combinatoria 20-B (1985) 43-47.
6. Iiro Honkala, Heikki Hämäläinen, Markku Kaikkonen: Some lower bounds for constant weight codes, Discrete Applied Mathematics 18 (1987) 95-98.
7. Iiro Honkala: Lower bounds for binary covering codes, IEEE Transactions on Information Theory 34 (1988) 326-329.
8. Iiro Honkala, Heikki Hämäläinen: A new construction for covering codes, IEEE Transactions on Information Theory 34 (1988) 1343-1344.
9. Wende Chen, Iiro Honkala: Lower bounds for q-ary covering codes, IEEE Transactions on Information Theory 36 (1990) 664-671.
10. Iiro Honkala: Modified bounds for covering codes, IEEE Transaction on Information Theory 37 (1991) 351-365.
11. Iiro Honkala, Heikki Hämäläinen: Bounds for abnormal binary codes with covering radius one, IEEE Transactions on Information Theory 37 (1991) 372-375.
12. Iiro Honkala: All binary codes with covering radius one are subnormal, Discrete Mathematics 94 (1991) 229-232.
13. Iiro Honkala: On (k,t)-subnormal covering codes, IEEE Transactions on Information Theory 37 (1991) 1203-1206.
14. Iiro Honkala: A Graham-Sloane type construction for s-surjective matrices, Journal of Algebraic Combinatorics 1 (1992) 347-351.
15. Iiro Honkala: On lengthening of covering codes, Discrete Mathematics 106/107 (1992) 291-295
16. Heikki Hämäläinen, Iiro Honkala, Markku Kaikkonen and Simon Litsyn: Bounds for binary multiple covering codes, Designs, Codes and Cryptography 3 (1993) 251-275.
17. Tuvi Etzion, Gadi Greenberg and Iiro Honkala: Normal and abnormal codes, IEEE Transactions on Information Theory 39 (1993) 1453-1456.
18. Iiro Honkala: On (q,1)-subnormal q-ary covering codes, Discrete Applied Mathematics 52 (1994) 213-221.
19. Iiro Honkala: On the normality of multiple covering codes, Discrete Mathematics 125 (1994) 229-239.
20. Heikki Hämäläinen, Iiro Honkala, Simon Litsyn and Patric Östergård: Bounds for binary codes that are multiple coverings of the farthest-off points, SIAM Journal on Discrete Mathematics 8 (1995) 196-207.
21. Heikki Hämäläinen, Iiro Honkala, Simon Litsyn and Patric Östergård: Football pools - a game for mathematicians. American Mathematical Monthly 102 (1995) 579-588.
22. Gérard Cohen, Iiro Honkala, Simon Litsyn and H. F. Mattson, Jr.: Weighted coverings and packings, IEEE Transactions on Information Theory 41 (1995) 1856-1867.
23. Iiro Honkala, Yrjö Kaipainen and Aimo Tietäväinen: Long binary narrow-sense BCH codes are normal. Applicable Algebra in Engineering, Communication and Computing 8 (1997) 49-55.
24. Iiro Honkala, Tero Laihonen and Simon Litsyn: On covering radius and discrete Chebyshev polynomials, Applicable Algebra in Engineering, Communication and Computing 8 (1997) 395-402.
25. Gérard Cohen, Iiro Honkala, Simon Litsyn and Patrick Solé: Long packing and covering codes, IEEE Transactions on Information Theory 43 (1997) 1617-1619.
26. Iiro Honkala: Combinatorial lower bounds for binary codes with covering radius one. Ars Combinatoria 50 (1998) 149-159.
27. Gérard Cohen, Iiro Honkala, Antoine Lobstein, Gilles Zémor: New bounds for codes identifying vertices in graphs, Electronic Journal of Combinatorics 6(1) (1999), R19.
28. Gérard Cohen, Sylvain Gravier, Iiro Honkala, Antoine Lobstein, Michel Mollard, Charles Payan, Gilles Zémor: Improved identifying codes for the grid, Electronic Journal of Combinatorics (1999), Comments to 6(1) (1999), R19.
29. Alexei Ashikhmin, Iiro Honkala, Tero Laihonen and Simon Litsyn: On Relations Between Covering Radius and Dual Distance, IEEE Transactions on Information Theory 45 (1999) 1808-1816.
30. Iiro Honkala and Tero Laihonen: The probability of undetected error can have several local maxima, IEEE Transactions on Information Theory 45 (1999) 2537-2539.
31. Uri Blass, Iiro Honkala and Simon Litsyn: On binary codes for identification, Journal of Combinatorial Designs 8 (2000) 151-156.
32. Gérard Cohen, Iiro Honkala, Antoine Lobstein, Gilles Zémor: Bounds for codes identifying vertices in the hexagonal grid, SIAM Journal on Discrete Mathematics 13 (2000) 492-504.
33. Iiro Honkala and Andrew Klapper: Bounds for the multicovering radii of Reed-Muller codes with applications to stream ciphers, Designs, Codes and Cryptography 23 (2001) 131-145.
34. Gérard Cohen, Iiro Honkala, Antoine Lobstein, Gilles Zémor: On codes identifying vertices in the two-dimensional square lattice with diagonals, IEEE Transactions on Computers 50 (2001) 174-176.
35. Uri Blass, Iiro Honkala, Mark Karpovsky, Simon Litsyn: Short dominating paths and cycles in the binary hypercube, Annals of Combinatorics 5 (2001) 51-59.
36. Iiro Honkala, Tero Laihonen, Sanna Ranto: On codes identifying sets of vertices in Hamming spaces, Designs, Codes and Cryptography, 24 (2001) 193-204.
37. Uri Blass, Iiro Honkala and Simon Litsyn: Bounds on identifying codes, Discrete Mathematics 241 (2001) 119-128.
38. Iiro Honkala and Tero Laihonen: On the probability of undetected error for binary codes used for combined correction and detection, Journal of Discrete Mathematical Sciences & Cryptography 4 (2001) 189-197.
39. Iiro Honkala: Triple systems for identifying quadruples, Australasian Journal of Combinatorics 25 (2002) 303-316.
40. Iiro Honkala, Tero Laihonen, Sanna Ranto: On strongly identifying codes, Discrete Mathematics 254 (2002) 191-205.
41. Iiro Honkala, Antoine Lobstein: On the density of identifying codes in the square lattice, Journal of Combinatorial Theory (B) 85 (2002) 297-306.
42. Iréne Charon, Iiro Honkala, Olivier Hudry, Antoine Lobstein: General bounds for identifying codes in some infinite regular graphs, Electronic Journal of Combinatorics 8(1) (2001), R39.
43. Sanna Ranto, Iiro Honkala, Tero Laihonen: Two optimal families of binary identifying codes, IEEE Transactions on Information Theory 48 (2002) 1200-1203.
44. Iiro Honkala, Andrew Klapper: Multicovering bounds from relative covering radii, SIAM J. Discrete Math. 15 (2002) 228-234.
45. Iiro Honkala, Antoine Lobstein: On identifying codes in binary Hamming spaces, Journal of Combinatorial Theory (A) 99 (2002) 232-243.
46. Iiro Honkala, Antoine Lobstein: On the complexity of the identification problem in Hamming spaces, Acta Informatica 38 (2002) 839-845.
47. Iiro Honkala, Tero Laihonen: On the identification of sets of points in the square lattice, Discrete and Computational Geometry, 29 (2003) 139-152.
48. Iiro Honkala, Mark Karpovsky, Simon Litsyn: Cycles for identifying vertices and edges in binary hypercube and 2-dimensional tori, Discrete Applied Mathematics 129 (2003) 409-419.
49. Iiro Honkala, Tero Laihonen: Codes for identification in the king lattice, Graphs and Combinatorics 19 (2003) 505-516.
50. Iiro Honkala, Antoine Lobstein: On identification in ${\bf Z}^2$ using translates of given patterns, Journal of Universal Computer Science 9 (2003) 1204-1219.
51. Iréne Charon, Iiro Honkala, Olivier Hudry, Antoine Lobstein: The minimum density of an identifying code in the king lattice, Discrete Mathematics, 276 (2004) 95-109.
52. Iiro Honkala, Tero Laihonen: On identification in the triangular grid, Journal of Combinatorial Theory B 91 (2004) 67-86.
53. Iiro Honkala, Tero Laihonen, Sanna Ranto: On locating-dominating codes in binary Hamming spaces, Journal of Discrete Mathematics and Theoretical Computer Science 6 (2004) 265-282.
54. Iiro Honkala, Tero Laihonen: On identifying codes in the triangular and square grids, SIAM Journal on Computing 33 (2004) 304-312.
55. Iiro Honkala, Tero Laihonen: On identifying codes in the hexagonal mesh, Information Processing Letters 89 (2004) 9-14.
56. Iiro Honkala: An optimal robust identifying code in the triangular lattice, Annals of Combinatorics 8 (2004) 303-323.
57. Iiro Honkala, Tero Laihonen: On locating-dominating sets in infinite grids, European Journal of Combinatorics 27 (2006) 218-227.
58. Iiro Honkala, Mark Karpovsky, Lev Levitin: On robust and dynamic identifying codes, IEEE Transactions on Information Theory 52 (2006) 599-612.
59. Iiro Honkala: An optimal locating-dominating set in the infinite triangular grid, Discrete Mathematics 306 (2006) 2670-2681.
60. Iiro Honkala: A family of optimal identifying codes in Z^2, Journal of Combinatorial Theory Series A 113 (2006) 1760-1763.
61. Iiro Honkala: On 2-edge-robust r-identifying codes in the king grid, Australasian Journal of Combinatorics 36 (2006) 151-165.
62. Iiro Honkala, Tero Laihonen: On a new class of identifying codes in graphs, Information Processing Letters 102 (2007) 92--98.
63. Iiro Honkala and Tero Laihonen: On identifying codes that are robust against edge changes, Information and Computation 205 (2007) 1078--1095.
64. Iréne Charon, Iiro Honkala, Olivier Hudry, and Antoine Lobstein: Structural properties of twin-free graphs, Electronic Journal of Combinatorics 14 (2007), no. 1, Research Paper 16, 15 pp.
65. Iiro Honkala and Tero Laihonen: On identifying codes in the king grid that are robust against edge deletions, Electronic Journal of Combinatorics 15 (2008), no. 1, Research Paper 3, 13 pp.
66. Iiro Honkala: On r-locating-dominating sets in paths, European Journal of Combinatorics 30 (2009) 1022-1025.
67. Paul Dorbec, Sylvain Gravier, Iiro Honkala, and Michel Mollard: Weighted codes in Lee metrics, Designs, Codes and Cryptography 52 (2009) 209-218.
68. David Auger, Iréne Charon, Iiro Honkala, Olivier Hudry, and Antoine Lobstein: Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs, Advances in Mathematics of Communications 3 (2009) 97-114.
69. Iiro Honkala and Tero Laihonen: On vertex-robust identifying codes of level three, Ars Combinatoria 94 (2010) 115-127.
70. Iiro Honkala: An optimal strongly identifying code in the infinite triangular grid, Electronic Journal of Combinatorics 17 (2010), no. 1, Research Paper 91, 10 pp.
71. Florent Foucaud, Iiro Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau: Locally identifying colourings for graphs with given maximum degree, Discrete Mathematics 312 (2012) 1832-1837.
72. David Auger and Iiro Honkala: Watching systems in the king grid, Graphs and Combinatorics 29 (2013) 333-347.
73. Iréne Charon, Iiro Honkala, Olivier Hudry, Antoine Lobstein: Minimum sizes of identifying codes in graphs differing by one vertex, Cryptography and Communication 5 (2013) 119-136.
74. Iréne Charon, Iiro Honkala, Olivier Hudry, Antoine Lobstein: Minimum sizes of identifying codes in graphs differing by one edge, Cryptography and Communication 6 (2014) 157-170.
75. Iiro Honkala, Olivier Hudry, Antoine Lobstein, On the number of optimal identifying codes in a twin-free graph, Discrete Applied Mathematics 180 (2015) 111-119.
76. Iiro Honkala, Olivier Hudry, Antoine Lobstein: On the ensemble of optimal dominating and locating-dominating codes in a graph, Information Processing Letters 115 (2015) 699-702.
77. Iiro Honkala, Olivier Hudry, Antoine Lobstein: On the ensemble of optimal identifying codes in a twin-free graph, Cryptography and Communication 8 (2016) 139-153.

### Refereed conference papers

78. Iiro Honkala: On the normality of codes with covering radius one, Proceedings of the Fourth Joint Swedish-Soviet Workshop on Information Theory, pp. 223-226, 1989.
79. Iiro Honkala: On the existence of constant weight codes attaining the second Johnson bound, II International Workshop "Algebraic and Combinatorial Coding Theory" 16-22 September 1990, Leningrad, USSR, Abstracts of papers, 71-74.
80. Gang Fang, H. C. A. van Tilborg, F. W. Sun and Iiro Honkala: Some features of binary block codes for correcting asymmetric errors, Proceedings of AAECC-10, in: Lecture Notes in Computer Science 673, Springer Verlag, Berlin, 1993, pp. 105-120.
81. Gérard Cohen, Iiro Honkala and Simon Litsyn: On weighted coverings with diameter one, Proceedings of Eurocode '92, CISM Courses and Lecture 339, Springer Verlag, Berlin, 1993, pp. 43-49. [Shorter, conference version of [22].]
82. Tuvi Etzion, Gadi Greenberg, Iiro Honkala: Normal and abnormal codes, Proceedings of IEEE Information Theory Symposium, 1993, p. 197. [Conference version of [17].]
83. Gang Fang, Iiro Honkala: On perfectness of binary block codes for correcting asymmetric errors. Proceedings of IEEE Information Theory Symposium, 1993, p. 39.
84. Iiro Honkala: A lower bound on binary codes with covering radius one, Proceedings of the French-Israeli Workshop in Algebraic Coding, Lecture Notes in Computer Science 781, Springer Verlag, Berlin, 1994, pp. 34-37.
85. Gérard Cohen, Iiro Honkala, Simon Litsyn, H.F. Mattson: Weighted coverings and packings. Proceedings of the IEEE Information Theory Symposium, 1994, p. 305. [Conference version of [22].]
86. Iiro Honkala, Yrjö Kaipainen, Aimo Tietäväinen: Long binary narrow-sense BCH codes are normal. Proceedings of the IEEE Information Theory Symposium, 1994, p. 48. [Conference version of [23].]
87. Iiro Honkala: A new lower bound on codes with covering radius one. Proceedings of International Symposium on Information Theory and Its Applications, Sydney, 1994, vol. 1, pp. 39-41.
88. Iiro Honkala, Simon Litsyn and Aimo Tietäväinen: On algebraic methods in covering radius problems. Lecture Notes in Computer Science 948, Springer Verlag, Berlin, 1995, pp. 21-32.
89. Iiro Honkala, Tero Laihonen, Simon Litsyn: Covering radius and discrete Chebyshev polynomials. IEEE Information Theory Symposium 1997, p. 365. [Conference version of [24].]
90. Iiro Honkala and Antoine Lobstein: On the complexity of calculating the minimum norm of a binary code, Proc. Workshop on Coding and Cryptography '99, Paris, 1999, pp. 21-27.
91. Iiro Honkala and Andrew Klapper: Multicovering Radii of Reed-Muller Codes and the Existence of Secure Stream Ciphers, Proceedings of the International Conference on Sequences and Their Applications SETA'98, Springer Verlag, Berlin, 1999, pp. 254-262. [Conference version of [33].]
92. Uri Blass, Iiro Honkala and Simon Litsyn: On the size of identifying codes, Proceedings of the conference AAECC-13, Hawaii, Springer-Verlag, Berlin, 1999, pp. 142-147. [Conference version of [37].]
93. Iiro Honkala, Andrew Klapper: Multicovering bounds from relative covering radii. IEEE Symposium on Information Theory, 2000, p. 393. [Conference version of [44].]
94. Iiro Honkala, Tero Laihonen: On the probability of undetected error. IEEE Symposium on Information Theory, 2000, p. 254. [Conference version of [30].]
95. Gérard Cohen, Iiro Honkala, Antoine Lobstein, Gilles Zémor: On codes that can identify vertices in graphs. IEEE Symposium on Information Theory, 2000, p. 11. [Shorter version of [85].]
96. Gérard Cohen, Iiro Honkala, Antoine Lobstein, Gilles Zémor: On identifying codes, Proceedings of the DIMACS Workshop "Codes and Association Schemes", AMS, Providence, 2001, pp. 97-109.
97. Iiro Honkala, Tero Laihonen, Sanna Ranto: Codes for strong identification, [conference version of [39]], Proceedings of WCC, 2001, pp. 279-287.
98. Iiro Honkala, Mark Karpovsky, Simon Litsyn: On the identification of vertices and edges using cycles, Proceedings of AAECC-14, Melbourne, Springer-Verlag, Berlin, 2001, pp. 308-314. [Conference version of 48.]
99. Iiro Honkala, Antoine Lobstein: Identifying vertices in the binary $n$-cube, Proceedings of ACCT, Tsarskoe Selo, 2002, pp. 198-201. [Conference version of [45].]
100. Iiro Honkala, Tero Laihonen: On identification of sets of vertices in the triangular grid, Proceedings of WCC 2003, pp. 265-271. [Conference version of [52].]
101. Paul Dorbec, Sylvain Gravier, Iiro Honkala, and Michel Mollard: Weighted perfect codes in Lee metrics, Electronic Notes in Discrete Mathematics 34 (2009) 477--481. [Conference version of [64].]

### 4. Other publications

102. Iiro Honkala: On the intersections and unions of Hamming spheres, Published on the occasion of the 50th birthday of Professor Aimo Tietäväinen, pp. 70-81, Turku, 1987.
103. Iiro Honkala: Combinatorial bounds for binary constant weight and covering codes, Ph.D. Thesis, Turku, January 1989 (consists of an introduction and of the papers [4], [5], [7], [8], [10] ja [94]).
104. Iiro Honkala and Simon Litsyn: Generalizations of the covering radius problem in coding theory. Bulletin of ICA, vol. 17 (1996) 39-46.
105. Ian Anderson and Iiro Honkala: A Short Course in Combinatorial Designs. Internet edition: http://www.utu.fi/~honkala/cover.html, 41 pp., 1997.
106. Tero Harju and Iiro Honkala (eds.): Proceedings of the 7th Nordic Combinatorial Conference, Turku, 1999.
107. Iiro Honkala: On the identifying radius of codes, Proceedings of the 7th Nordic Combinatorial Conference, Turku, 1999, pp. 39-43.
108. Iiro Honkala, Tero Laihonen: Virheitä havaitsevista koodeista, Arkhimedes, no. 3, (2001), pp. 20-25.