Iiro S. Honkala

79 papers C 1Journal 71Unranked 6
YearRankTypeTitle / Venue / Authors
2020 J jnl
Special Issue: "Computer Algebra and Application to Combinatorics, Coding Theory and Cryptography" ACA 2019, Montreal, Canada, July 16-20, 2019.
Appl. Algebra Eng. Commun. Comput.
Kenza Guenda, Iiro S. Honkala, Ilias S. Kotsireas, Teo Mora, Qiang Wang
2016 J jnl
On the ensemble of optimal identifying codes in a twin-free graph.
Cryptogr. Commun.
Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2015 J jnl
On the ensemble of optimal dominating and locating-dominating codes in a graph.
Inf. Process. Lett.
Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2015 J jnl
On the number of optimal identifying codes in a twin-free graph.
Discret. Appl. Math.
Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2014 J jnl
Minimum sizes of identifying codes in graphs differing by one edge.
Cryptogr. Commun.
Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2013 J jnl
Minimum sizes of identifying codes in graphs differing by one vertex.
Cryptogr. Commun.
Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2013 J jnl
Watching Systems in the King Grid.
Graphs Comb.
David Auger, Iiro S. Honkala
2012 J jnl
Locally identifying colourings for graphs with given maximum degree.
Discret. Math.
Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau
2011 J jnl
Locally identifying colourings for graphs with given maximum degree
CoRR
Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau
2010 J jnl
An Optimal Strongly Identifying Code in the Infinite Triangular Grid.
Electron. J. Comb.
Iiro S. Honkala
2010 J jnl
On Vertex-Robust Identifying Codes of Level Three.
Ars Comb.
Iiro S. Honkala, Tero Laihonen
2009 J jnl
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs.
Adv. Math. Commun.
David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2009 J jnl
Erratum.
Adv. Math. Commun.
David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2009 J jnl
On r-locating-dominating sets in paths.
Eur. J. Comb.
Iiro S. Honkala
2009 J jnl
Weighted codes in Lee metrics.
Des. Codes Cryptogr.
Paul Dorbec, Sylvain Gravier, Iiro S. Honkala, Michel Mollard
2009 J jnl
Weighted perfect codes in Lee metric.
Electron. Notes Discret. Math.
Paul Dorbec, Sylvain Gravier, Iiro S. Honkala, Michel Mollard
2008 J jnl
On Identifying Codes in the King Grid that are Robust Against Edge Deletions.
Electron. J. Comb.
Iiro S. Honkala, Tero Laihonen
2007 J jnl
On a new class of identifying codes in graphs.
Inf. Process. Lett.
Iiro S. Honkala, Tero Laihonen
2007 J jnl
On identifying codes that are robust against edge changes.
Inf. Comput.
Iiro S. Honkala, Tero Laihonen
2007 J jnl
Structural Properties of Twin-Free Graphs.
Electron. J. Comb.
Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2006 J jnl
A family of optimal identifying codes in Z
J. Comb. Theory A
Iiro S. Honkala
2006 J jnl
An optimal locating-dominating set in the infinite triangular grid.
Discret. Math.
Iiro S. Honkala
2006 J jnl
On 2-edge robust r-identifying codes in the king grid.
Australas. J Comb.
Iiro S. Honkala
2006 J jnl
On locating-dominating sets in infinite grids.
Eur. J. Comb.
Iiro S. Honkala, Tero Laihonen
2006 J jnl
On robust and dynamic identifying codes.
IEEE Trans. Inf. Theory
Iiro S. Honkala, Mark G. Karpovsky, Lev B. Levitin
2005 — book
Covering Codes.
Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Antoine Lobstein
2004 J jnl
On Locating-Dominating Codes in Binary Hamming Spaces.
Discret. Math. Theor. Comput. Sci.
Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
2004 J jnl
On identification in the triangular grid.
J. Comb. Theory B
Iiro S. Honkala, Tero Laihonen
2004 J jnl
On identifying codes in the hexagonal mesh.
Inf. Process. Lett.
Iiro S. Honkala, Tero Laihonen
2004 J jnl
On identifying codes in the triangular and square grids.
SIAM J. Comput.
Iiro S. Honkala, Tero Laihonen
2004 J jnl
The minimum density of an identifying code in the king lattice.
Discret. Math.
Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2003 J jnl
Codes for Identification in the King Lattice.
Graphs Comb.
Iiro S. Honkala, Tero Laihonen
2003 J jnl
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori.
Discret. Appl. Math.
Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn
2003 J jnl
On Identification in ZZ
J. Univers. Comput. Sci.
Iiro S. Honkala, Antoine Lobstein
2003 J jnl
On the Identification of Sets of Points in the Square Lattice.
Discret. Comput. Geom.
Iiro S. Honkala, Tero Laihonen
2002 J jnl
Multicovering Bounds from Relative Covering Radii.
SIAM J. Discret. Math.
Iiro S. Honkala, Andrew Klapper
2002 J jnl
On Identifying Codes in Binary Hamming Spaces.
J. Comb. Theory A
Iiro S. Honkala, Antoine Lobstein
2002 J jnl
On strongly identifying codes.
Discret. Math.
Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
2002 J jnl
On the Density of Identifying Codes in the Square Lattice.
J. Comb. Theory B
Iiro S. Honkala, Antoine Lobstein
2002 J jnl
On the complexity of the identification problem in Hamming spaces.
Acta Informatica
Iiro S. Honkala, Antoine Lobstein
2002 J jnl
Triple systems for identifying quadruples.
Australas. J Comb.
Iiro S. Honkala
2002 J jnl
Two families of optimal identifying codes in binary Hamming spaces.
IEEE Trans. Inf. Theory
Sanna M. Ranto, Iiro S. Honkala, Tero Laihonen
2001 J jnl
Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers.
Des. Codes Cryptogr.
Iiro S. Honkala, Andrew Klapper
2001 J jnl
Bounds on identifying codes.
Discret. Math.
Uri Blass, Iiro S. Honkala, Simon Litsyn
2001 J jnl
Codes for Strong Identification.
Electron. Notes Discret. Math.
Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
2001 J jnl
General Bounds for Identifying Codes in Some Infinite Regular Graphs.
Electron. J. Comb.
Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2001 J jnl
On Codes Identifying Sets of Vertices in Hamming Spaces.
Des. Codes Cryptogr.
Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
2001 J jnl
On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals.
IEEE Trans. Computers
Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
2001 — conf
On the Identification of Vertices and Edges Using Cycles.
AAECC
Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn
2000 J jnl
Bounds for Codes Identifying Vertices in the Hexagonal Grid.
SIAM J. Discret. Math.
Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
1999 J jnl
New Bounds for Codes Identifying Vertices in Graphs.
Electron. J. Comb.
Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
1999 — conf
On identifying codes.
Codes and Association Schemes
Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
1999 J jnl
On relations between covering radius and dual distance.
IEEE Trans. Inf. Theory
Alexei E. Ashikhmin, Iiro S. Honkala, Tero Laihonen, Simon Litsyn
1999 — conf
On tHe Size of Identifying Codes.
AAECC
Uri Blass, Iiro S. Honkala, Simon Litsyn
1999 J jnl
The probability of undetected error can have several local maxima.
IEEE Trans. Inf. Theory
Iiro S. Honkala, Tero Laihonen
1998 J jnl
Combinatorial lower bounds on binary codes with covering radius one.
Ars Comb.
Iiro S. Honkala
1998 C conf
Multicovering Radii of Reed-Muller Codes and the Existence of Secure Stream Ciphers (Extended Abstract).
SETA
Iiro S. Honkala, Andrew Klapper
1997 J jnl
Long packing and covering codes.
IEEE Trans. Inf. Theory
Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Patrick Solé
1997 J jnl
On Covering Radius and Discrete Chebyshev Polynomials.
Appl. Algebra Eng. Commun. Comput.
Iiro S. Honkala, Tero Laihonen, Simon Litsyn
1996 J jnl
Long binary narrow-sense BCH codes are normal.
Appl. Algebra Eng. Commun. Comput.
Iiro S. Honkala, Yrjö Kaipainen, Aimo Tietäväinen
1995 J jnl
Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points.
SIAM J. Discret. Math.
Heikki O. Hämäläinen, Iiro S. Honkala, Simon Litsyn, Patric R. J. Östergård
1995 — conf
On Algebraic Methods in Covering Radius Problems.
AAECC
Iiro S. Honkala, Simon Litsyn, Aimo Tietäväinen
1995 J jnl
Weighted coverings and packings.
IEEE Trans. Inf. Theory
Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, H. F. Mattson Jr.
1994 J jnl
On (q, 1)-subnormal q-ary Covering Codes.
Discret. Appl. Math.
Iiro S. Honkala
1994 J jnl
On the normality of multiple covering codes.
Discret. Math.
Iiro S. Honkala
1993 — conf
A Lower Bound on Binary Codes with Covering Radius One.
Algebraic Coding
Iiro S. Honkala
1993 J jnl
Bounds for Binary Multiple Covering Codes.
Des. Codes Cryptogr.
Heikki O. Hämäläinen, Iiro S. Honkala, Markku K. Kaikkonen, Simon Litsyn
1993 J jnl
Normal and abnormal codes.
IEEE Trans. Inf. Theory
Tuvi Etzion, Gadi Greenberg, Iiro S. Honkala
1993 — conf
Some Features of Binary Block Codes for Correcting Asymmetric Errors.
AAECC
G. Fang, Henk C. A. van Tilborg, Feng-Wen Sun, Iiro S. Honkala
1992 J jnl
On lengthening of covering codes.
Discret. Math.
Iiro S. Honkala
1991 J jnl
All binary codes with covering radius one are subnormal.
Discret. Math.
Iiro S. Honkala
1991 J jnl
Bounds for abnormal binary codes with covering radius one.
IEEE Trans. Inf. Theory
Iiro S. Honkala, Heikki O. Hämäläinen
1991 J jnl
Modified bounds for coveting codes.
IEEE Trans. Inf. Theory
Iiro S. Honkala
1991 J jnl
On (k, t) -subnormal covering codes.
IEEE Trans. Inf. Theory
Iiro S. Honkala
1990 J jnl
Lower bounds for q-ary covering codes.
IEEE Trans. Inf. Theory
Wende Chen, Iiro S. Honkala
1988 J jnl
A new construction for covering codes.
IEEE Trans. Inf. Theory
Iiro S. Honkala, Heikki O. Hämäläinen
1988 J jnl
Lower bounds for binary covering codes.
IEEE Trans. Inf. Theory
Iiro S. Honkala
1987 J jnl
Some lower bounds for constant weight codes.
Discret. Appl. Math.
Iiro S. Honkala, Heikki O. Hämäläinen, Markku K. Kaikkonen
1985 J jnl
A modification of the Zinoviev lower bound for constant weight codes.
Discret. Appl. Math.
Iiro S. Honkala, Heikki O. Hämäläinen, Markku K. Kaikkonen