A modification of the Zinoviev lower bound for constant weight codes. - Iiro S. Honkala; Heikki O. Hämäläinen; Markku K. Kaikkonen (Discret. Appl. Math., 1985)

Some lower bounds for constant weight codes. - Iiro S. Honkala; Heikki O. Hämäläinen; Markku K. Kaikkonen (Discret. Appl. Math., 1987)

Lower bounds for binary covering codes. - Iiro S. Honkala (IEEE Trans. Inf. Theory, 1988)

A new construction for covering codes. - Iiro S. Honkala; Heikki O. Hämäläinen (IEEE Trans. Inf. Theory, 1988)

Lower bounds for q-ary covering codes. - Wende Chen; Iiro S. Honkala (IEEE Trans. Inf. Theory, 1990)

All binary codes with covering radius one are subnormal. - Iiro S. Honkala (Discret. Math., 1991)

Modified bounds for coveting codes. - Iiro S. Honkala (IEEE Trans. Inf. Theory, 1991)

On (k, t) -subnormal covering codes. - Iiro S. Honkala (IEEE Trans. Inf. Theory, 1991)

Bounds for abnormal binary codes with covering radius one. - Iiro S. Honkala; Heikki O. Hämäläinen (IEEE Trans. Inf. Theory, 1991)

On lengthening of covering codes. - Iiro S. Honkala (Discret. Math., 1992)

Some Features of Binary Block Codes for Correcting Asymmetric Errors. - G. Fang; Henk C. A. van Tilborg; Feng-Wen Sun; Iiro S. Honkala (AAECC, 1993)

A Lower Bound on Binary Codes with Covering Radius One. - Iiro S. Honkala (Algebraic Coding, 1993)

Bounds for Binary Multiple Covering Codes. - Heikki O. Hämäläinen; Iiro S. Honkala; Markku K. Kaikkonen; Simon Litsyn (Des. Codes Cryptogr., 1993)

Normal and abnormal codes. - Tuvi Etzion; Gadi Greenberg; Iiro S. Honkala (IEEE Trans. Inf. Theory, 1993)

On (q, 1)-subnormal q-ary Covering Codes. - Iiro S. Honkala (Discret. Appl. Math., 1994)

On the normality of multiple covering codes. - Iiro S. Honkala (Discret. Math., 1994)

On Algebraic Methods in Covering Radius Problems. - Iiro S. Honkala; Simon Litsyn; Aimo Tietäväinen (AAECC, 1995)

Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points. - Heikki O. Hämäläinen; Iiro S. Honkala; Simon Litsyn; Patric R. J. Östergård (SIAM J. Discret. Math., 1995)

Weighted coverings and packings. - Gérard D. Cohen; Iiro S. Honkala; Simon Litsyn; H. F. Mattson Jr. (IEEE Trans. Inf. Theory, 1995)

Long binary narrow-sense BCH codes are normal. - Iiro S. Honkala; Yrjö Kaipainen; Aimo Tietäväinen (Appl. Algebra Eng. Commun. Comput., 1996)

On Covering Radius and Discrete Chebyshev Polynomials. - Iiro S. Honkala; Tero Laihonen; Simon Litsyn (Appl. Algebra Eng. Commun. Comput., 1997)

Long packing and covering codes. - Gérard D. Cohen; Iiro S. Honkala; Simon Litsyn; Patrick Solé (IEEE Trans. Inf. Theory, 1997)

Multicovering Radii of Reed-Muller Codes and the Existence of Secure Stream Ciphers (Extended Abstract). - Iiro S. Honkala; Andrew Klapper (SETA, 1998)

Combinatorial lower bounds on binary codes with covering radius one. - Iiro S. Honkala (Ars Comb., 1998)

On tHe Size of Identifying Codes. - Uri Blass; Iiro S. Honkala; Simon Litsyn (AAECC, 1999)

On identifying codes. - Gérard D. Cohen; Iiro S. Honkala; Antoine Lobstein; Gilles Zémor (Codes and Association Schemes, 1999)

New Bounds for Codes Identifying Vertices in Graphs. - Gérard D. Cohen; Iiro S. Honkala; Antoine Lobstein; Gilles Zémor (Electron. J. Comb., 1999)

On relations between covering radius and dual distance. - Alexei E. Ashikhmin; Iiro S. Honkala; Tero Laihonen; Simon Litsyn (IEEE Trans. Inf. Theory, 1999)

The probability of undetected error can have several local maxima. - Iiro S. Honkala; Tero Laihonen (IEEE Trans. Inf. Theory, 1999)

Bounds for Codes Identifying Vertices in the Hexagonal Grid. - Gérard D. Cohen; Iiro S. Honkala; Antoine Lobstein; Gilles Zémor (SIAM J. Discret. Math., 2000)

On the Identification of Vertices and Edges Using Cycles. - Iiro S. Honkala; Mark G. Karpovsky; Simon Litsyn (AAECC, 2001)

General Bounds for Identifying Codes in Some Infinite Regular Graphs. - Irène Charon; Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Electron. J. Comb., 2001)

Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers. - Iiro S. Honkala; Andrew Klapper (Des. Codes Cryptogr., 2001)

On Codes Identifying Sets of Vertices in Hamming Spaces. - Iiro S. Honkala; Tero Laihonen; Sanna M. Ranto (Des. Codes Cryptogr., 2001)

Bounds on identifying codes. - Uri Blass; Iiro S. Honkala; Simon Litsyn (Discret. Math., 2001)

Codes for Strong Identification. - Iiro S. Honkala; Tero Laihonen; Sanna M. Ranto (Electron. Notes Discret. Math., 2001)

On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals. - Gérard D. Cohen; Iiro S. Honkala; Antoine Lobstein; Gilles Zémor (IEEE Trans. Computers, 2001)

On the complexity of the identification problem in Hamming spaces. - Iiro S. Honkala; Antoine Lobstein (Acta Informatica, 2002)

Triple systems for identifying quadruples. - Iiro S. Honkala (Australas. J Comb., 2002)

On strongly identifying codes. - Iiro S. Honkala; Tero Laihonen; Sanna M. Ranto (Discret. Math., 2002)

On Identifying Codes in Binary Hamming Spaces. - Iiro S. Honkala; Antoine Lobstein (J. Comb. Theory A, 2002)

On the Density of Identifying Codes in the Square Lattice. - Iiro S. Honkala; Antoine Lobstein (J. Comb. Theory B, 2002)

Multicovering Bounds from Relative Covering Radii. - Iiro S. Honkala; Andrew Klapper (SIAM J. Discret. Math., 2002)

Two families of optimal identifying codes in binary Hamming spaces. - Sanna M. Ranto; Iiro S. Honkala; Tero Laihonen (IEEE Trans. Inf. Theory, 2002)

Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori. - Iiro S. Honkala; Mark G. Karpovsky; Simon Litsyn (Discret. Appl. Math., 2003)

On the Identification of Sets of Points in the Square Lattice. - Iiro S. Honkala; Tero Laihonen (Discret. Comput. Geom., 2003)

Codes for Identification in the King Lattice. - Iiro S. Honkala; Tero Laihonen (Graphs Comb., 2003)

On Identification in ZZ2 Using Translates of Given Patterns. - Iiro S. Honkala; Antoine Lobstein (J. Univers. Comput. Sci., 2003)

The minimum density of an identifying code in the king lattice. - Irène Charon; Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Discret. Math., 2004)

On Locating-Dominating Codes in Binary Hamming Spaces. - Iiro S. Honkala; Tero Laihonen; Sanna M. Ranto (Discret. Math. Theor. Comput. Sci., 2004)

On identifying codes in the hexagonal mesh. - Iiro S. Honkala; Tero Laihonen (Inf. Process. Lett., 2004)

On identification in the triangular grid. - Iiro S. Honkala; Tero Laihonen (J. Comb. Theory B, 2004)

On identifying codes in the triangular and square grids. - Iiro S. Honkala; Tero Laihonen (SIAM J. Comput., 2004)

Covering Codes. - Gérard D. Cohen; Iiro S. Honkala; Simon Litsyn; Antoine Lobstein (North-Holland, 2005)

On 2-edge robust r-identifying codes in the king grid. - Iiro S. Honkala (Australas. J Comb., 2006)

An optimal locating-dominating set in the infinite triangular grid. - Iiro S. Honkala (Discret. Math., 2006)

On locating-dominating sets in infinite grids. - Iiro S. Honkala; Tero Laihonen (Eur. J. Comb., 2006)

A family of optimal identifying codes in Z2. - Iiro S. Honkala (J. Comb. Theory A, 2006)

On robust and dynamic identifying codes. - Iiro S. Honkala; Mark G. Karpovsky; Lev B. Levitin (IEEE Trans. Inf. Theory, 2006)

Structural Properties of Twin-Free Graphs. - Irène Charon; Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Electron. J. Comb., 2007)

On identifying codes that are robust against edge changes. - Iiro S. Honkala; Tero Laihonen (Inf. Comput., 2007)

On a new class of identifying codes in graphs. - Iiro S. Honkala; Tero Laihonen (Inf. Process. Lett., 2007)

On Identifying Codes in the King Grid that are Robust Against Edge Deletions. - Iiro S. Honkala; Tero Laihonen (Electron. J. Comb., 2008)

Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs. - David Auger; Irène Charon; Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Adv. Math. Commun., 2009)

Erratum. - David Auger; Irène Charon; Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Adv. Math. Commun., 2009)

Weighted codes in Lee metrics. - Paul Dorbec; Sylvain Gravier; Iiro S. Honkala; Michel Mollard (Des. Codes Cryptogr., 2009)

On r-locating-dominating sets in paths. - Iiro S. Honkala (Eur. J. Comb., 2009)

Weighted perfect codes in Lee metric. - Paul Dorbec; Sylvain Gravier; Iiro S. Honkala; Michel Mollard (Electron. Notes Discret. Math., 2009)

On Vertex-Robust Identifying Codes of Level Three. - Iiro S. Honkala; Tero Laihonen (Ars Comb., 2010)

An Optimal Strongly Identifying Code in the Infinite Triangular Grid. - Iiro S. Honkala (Electron. J. Comb., 2010)

Locally identifying colourings for graphs with given maximum degree. - Florent Foucaud; Iiro S. Honkala; Tero Laihonen; Aline Parreau; Guillem Perarnau (Discret. Math., 2012)

Minimum sizes of identifying codes in graphs differing by one vertex. - Irène Charon; Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Cryptogr. Commun., 2013)

Watching Systems in the King Grid. - David Auger; Iiro S. Honkala (Graphs Comb., 2013)

Minimum sizes of identifying codes in graphs differing by one edge. - Irène Charon; Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Cryptogr. Commun., 2014)

On the number of optimal identifying codes in a twin-free graph. - Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Discret. Appl. Math., 2015)

On the ensemble of optimal dominating and locating-dominating codes in a graph. - Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Inf. Process. Lett., 2015)

On the ensemble of optimal identifying codes in a twin-free graph. - Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Cryptogr. Commun., 2016)

Special Issue: "Computer Algebra and Application to Combinatorics, Coding Theory and Cryptography" ACA 2019, Montreal, Canada, July 16-20, 2019. - Kenza Guenda; Iiro S. Honkala; Ilias S. Kotsireas; Teo Mora; Qiang Wang 012 (Appl. Algebra Eng. Commun. Comput., 2020)