I. Honkala

Most-cited papers

Covering Codes
G. Cohen, I. Honkala, S. Litsyn, A. Lobstein
2005North-Holland Mathematical Library548 citations
Semantic Scholar
Linear Codes with Covering Radius and Codimension
G. Cohen, I. Honkala, S. Litsyn, A. Lobstein +5 more
2001112 citations
Semantic Scholar
On identifying codes
G. Cohen, I. Honkala, A. Lobstein, G. Zémor
1999Codes and Association Schemes76 citations Open access
Semantic Scholar
Bounds on identifying codes
U. Blass, I. Honkala, S. Litsyn
2001Discrete Mathematics72 citations Open access
Semantic Scholar
On strongly identifying codes
I. Honkala, T. Laihonen, Sanna M. Ranto
2002Discrete Mathematics68 citations Open access
Semantic Scholar
On binary codes for identification
U. Blass, I. Honkala, S. Litsyn
200065 citations
Semantic Scholar
General Bounds for Identifying Codes in Some Infinite Regular Graphs
I. Charon, I. Honkala, O. Hudry, A. Lobstein
2001Electronic Journal of Combinatorics61 citations Open access
Semantic Scholar
On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals
G. Cohen, I. Honkala, A. Lobstein, G. Zémor
2001IEEE Trans. Computers59 citations
Semantic Scholar
Bounds for Codes Identifying Vertices in the Hexagonal Grid
G. Cohen, I. Honkala, A. Lobstein, G. Zémor
2000SIAM Journal on Discrete Mathematics57 citations
Semantic Scholar
The minimum density of an identifying code in the king lattice
I. Charon, I. Honkala, O. Hudry, A. Lobstein
2004Discrete Mathematics56 citations Open access
Semantic Scholar
New Bounds for Codes Identifying Vertices in Graphs
G. Cohen, I. Honkala, A. Lobstein, G. Zémor
1999Electronic Journal of Combinatorics53 citations Open access
Semantic Scholar
On Identifying Codes in Binary Hamming Spaces
I. Honkala, A. Lobstein
2002Journal of Combinatorial Theory52 citations Open access
Semantic Scholar
On locating-dominating sets in infinite grids
I. Honkala, T. Laihonen
2006European journal of combinatorics (Print)49 citations Open access
Semantic Scholar
Football Pools A Game for Mathematicians
H. Hämäläinen, I. Honkala, S. Litsyn, P. Östergård
199547 citations
Semantic Scholar
Structural Properties of Twin-Free Graphs
I. Charon, I. Honkala, O. Hudry, A. Lobstein
2007Electronic Journal of Combinatorics45 citations Open access
Semantic Scholar
On Codes Identifying Sets of Vertices in Hamming Spaces
I. Honkala, T. Laihonen, Sanna M. Ranto
2000Des. Codes Cryptogr.43 citations
Semantic Scholar
Modified bounds for coveting codes
I. Honkala
1991IEEE Transactions on Information Theory43 citations
Semantic Scholar
On robust and dynamic identifying codes
I. Honkala, M. Karpovsky, L. Levitin
2006IEEE Transactions on Information Theory42 citations
Semantic Scholar
An optimal locating-dominating set in the infinite triangular grid
I. Honkala
2006Discrete Mathematics37 citations Open access
Semantic Scholar
On the Density of Identifying Codes in the Square Lattice
I. Honkala, A. Lobstein
2002J. Comb. Theory B36 citations Open access
Semantic Scholar
Lower bounds for q-ary covering codes
Wende Chen, I. Honkala
1990IEEE Transactions on Information Theory35 citations
Semantic Scholar
Two families of optimal identifying codes in binary Hamming spaces
Sanna M. Ranto, I. Honkala, T. Laihonen
2000IEEE Transactions on Information Theory34 citations
Semantic Scholar
On Locating-Dominating Codes in Binary Hamming Spaces
I. Honkala, T. Laihonen, Sanna M. Ranto
2004Discrete Mathematics & Theoretical Computer Science32 citations Open access
Semantic Scholar
On identifying codes in the triangular and square grids
I. Honkala, T. Laihonen
2004SIAM journal on computing (Print)31 citations
Semantic Scholar
On a new class of identifying codes in graphs
I. Honkala, T. Laihonen
2007Information Processing Letters30 citations
Semantic Scholar
Codes for Identification in the King Lattice
I. Honkala, T. Laihonen
2003Graphs Comb.30 citations
Semantic Scholar
Bounds for binary multiple covering codes
H. Hämäläinen, I. Honkala, M. K. Kaikkonen, S. Litsyn
1993Des. Codes Cryptogr.27 citations
Semantic Scholar
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
I. Honkala, M. Karpovsky, S. Litsyn
2003Discrete Applied Mathematics23 citations Open access
Semantic Scholar
Codes and Number Theory
I. Honkala, A. Tietäväinen
199723 citations
Semantic Scholar
On the Identification of Sets of Points in the Square Lattice
I. Honkala, T. Laihonen
2002Discrete & Computational Geometry22 citations Open access
Semantic Scholar
On (k, t) -subnormal covering codes
I. Honkala
1991IEEE Transactions on Information Theory21 citations
Semantic Scholar
A new construction for covering codes
I. Honkala, H. Hämäläinen
1988IEEE Transactions on Information Theory21 citations
Semantic Scholar
On identifying codes in the hexagonal mesh
I. Honkala, T. Laihonen
2004Information Processing Letters19 citations
Semantic Scholar
On relations between covering radius and dual distance
A. Ashikhmin, I. Honkala, T. K. Laibonen, S. Litsyn
1999IEEE Transactions on Information Theory19 citations
Semantic Scholar
An Optimal Edge-Robust Identifying Code in the Triangular Lattice
I. Honkala
200417 citations
Semantic Scholar
Locally identifying colourings for graphs with given maximum degree
F. Foucaud, I. Honkala, T. Laihonen, Aline Parreau +1 more
2011Discrete Mathematics16 citations Open access
Semantic Scholar
On the complexity of the identification problem in Hamming spaces
I. Honkala, A. Lobstein
2002Acta Informatica16 citations
Semantic Scholar
On identification in the triangular grid
I. Honkala, T. Laihonen
2004J. Comb. Theory B15 citations Open access
Semantic Scholar
Bounds for abnormal binary codes with covering radius one
I. Honkala, H. Hämäläinen
1991IEEE Transactions on Information Theory15 citations
Semantic Scholar
Lower bounds for binary covering codes
I. Honkala
1988IEEE Transactions on Information Theory15 citations
Semantic Scholar
On identifying codes that are robust against edge changes
I. Honkala, T. Laihonen
2007Information and Computation14 citations Open access
Semantic Scholar
Weighted coverings and packings
G. Cohen, I. Honkala, S. Litsyn, H. F. Mattson
1994Proceedings of 1994 IEEE International Symposium on Information Theory13 citations
Semantic Scholar
An Optimal Strongly Identifying Code in the Infinite Triangular Grid
I. Honkala
2010Electronic Journal of Combinatorics12 citations Open access
Semantic Scholar
On r-locating-dominating sets in paths
I. Honkala
2009European journal of combinatorics (Print)11 citations Open access
Semantic Scholar
Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points
H. Hämäläinen, I. Honkala, S. Litsyn, P. Östergård
1995SIAM Journal on Discrete Mathematics11 citations
Semantic Scholar
On Identification in ZZ2 Using Translates of Given Patterns
I. Honkala, A. Lobstein
2003Journal of universal computer science (Online)10 citations Open access
Semantic Scholar
On the number of optimal identifying codes in a twin-free graph
I. Honkala, O. Hudry, A. Lobstein
2015Discrete Applied Mathematics9 citations Open access
Semantic Scholar
On the ensemble of optimal dominating and locating-dominating codes in a graph
I. Honkala, O. Hudry, A. Lobstein
2015Information Processing Letters8 citations
Semantic Scholar
On the ensemble of optimal identifying codes in a twin-free graph
I. Honkala, O. Hudry, A. Lobstein
2015Cryptography and Communications8 citations
Semantic Scholar
Watching Systems in the King Grid
David Auger, I. Honkala
2013Graphs Comb.8 citations
Semantic Scholar