default search action
Iiro S. Honkala
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j70]Kenza Guenda, Iiro S. Honkala, Ilias S. Kotsireas, Teo Mora, Qiang Wang:
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. 31(3-4): 171-172 (2020)
2010 – 2019
- 2016
- [j69]Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
On the ensemble of optimal identifying codes in a twin-free graph. Cryptogr. Commun. 8(1): 139-153 (2016) - 2015
- [j68]Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
On the number of optimal identifying codes in a twin-free graph. Discret. Appl. Math. 180: 111-119 (2015) - [j67]Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
On the ensemble of optimal dominating and locating-dominating codes in a graph. Inf. Process. Lett. 115(9): 699-702 (2015) - 2014
- [j66]Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Minimum sizes of identifying codes in graphs differing by one edge. Cryptogr. Commun. 6(2): 157-170 (2014) - 2013
- [j65]Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Minimum sizes of identifying codes in graphs differing by one vertex. Cryptogr. Commun. 5(2): 119-136 (2013) - [j64]David Auger, Iiro S. Honkala:
Watching Systems in the King Grid. Graphs Comb. 29(3): 333-347 (2013) - 2012
- [j63]Florent Foucaud, Iiro S. Honkala, Tero Laihonen
, Aline Parreau, Guillem Perarnau
Locally identifying colourings for graphs with given maximum degree. Discret. Math. 312(10): 1832-1837 (2012) - 2011
- [i1]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
- [j62]Iiro S. Honkala, Tero Laihonen:
On Vertex-Robust Identifying Codes of Level Three. Ars Comb. 94 (2010) - [j61]Iiro S. Honkala:
An Optimal Strongly Identifying Code in the Infinite Triangular Grid. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j60]David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs. Adv. Math. Commun. 3(1): 97-114 (2009) - [j59]David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Erratum. Adv. Math. Commun. 3(4): 429-430 (2009) - [j58]Paul Dorbec
Weighted codes in Lee metrics. Des. Codes Cryptogr. 52(2): 209-218 (2009) - [j57]Iiro S. Honkala:
On r-locating-dominating sets in paths. Eur. J. Comb. 30(4): 1022-1025 (2009) - [j56]Paul Dorbec
Weighted perfect codes in Lee metric. Electron. Notes Discret. Math. 34: 477-481 (2009) - 2008
- [j55]Iiro S. Honkala, Tero Laihonen:
On Identifying Codes in the King Grid that are Robust Against Edge Deletions. Electron. J. Comb. 15(1) (2008) - 2007
- [j54]Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Structural Properties of Twin-Free Graphs. Electron. J. Comb. 14(1) (2007) - [j53]Iiro S. Honkala, Tero Laihonen
On identifying codes that are robust against edge changes. Inf. Comput. 205(7): 1078-1095 (2007) - [j52]Iiro S. Honkala, Tero Laihonen
On a new class of identifying codes in graphs. Inf. Process. Lett. 102(2-3): 92-98 (2007) - 2006
- [j51]Iiro S. Honkala:
On 2-edge robust r-identifying codes in the king grid. Australas. J Comb. 36: 151-166 (2006) - [j50]Iiro S. Honkala:
An optimal locating-dominating set in the infinite triangular grid. Discret. Math. 306(21): 2670-2681 (2006) - [j49]Iiro S. Honkala, Tero Laihonen
On locating-dominating sets in infinite grids. Eur. J. Comb. 27(2): 218-227 (2006) - [j48]Iiro S. Honkala:
A family of optimal identifying codes in Z2. J. Comb. Theory A 113(8): 1760-1763 (2006) - [j47]Iiro S. Honkala, Mark G. Karpovsky, Lev B. Levitin:
On robust and dynamic identifying codes. IEEE Trans. Inf. Theory 52(2): 599-612 (2006) - 2005
- [b1]Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Antoine Lobstein:
Covering Codes. North-Holland mathematical library 54, North-Holland 2005, ISBN 978-0-444-82511-7, pp. I-XXI, 1-542 - 2004
- [j46]Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
The minimum density of an identifying code in the king lattice. Discret. Math. 276(1-3): 95-109 (2004) - [j45]Iiro S. Honkala, Tero Laihonen
On Locating-Dominating Codes in Binary Hamming Spaces. Discret. Math. Theor. Comput. Sci. 6(2): 265-282 (2004) - [j44]Iiro S. Honkala, Tero Laihonen
On identifying codes in the hexagonal mesh. Inf. Process. Lett. 89(1): 9-14 (2004) - [j43]Iiro S. Honkala, Tero Laihonen
On identification in the triangular grid. J. Comb. Theory B 91(1): 67-86 (2004) - [j42]Iiro S. Honkala, Tero Laihonen
On identifying codes in the triangular and square grids. SIAM J. Comput. 33(2): 304-312 (2004) - 2003
- [j41]Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn:
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori. Discret. Appl. Math. 129(2-3): 409-419 (2003) - [j40]Iiro S. Honkala, Tero Laihonen
On the Identification of Sets of Points in the Square Lattice. Discret. Comput. Geom. 29(1): 139-152 (2003) - [j39]Iiro S. Honkala, Tero Laihonen
Codes for Identification in the King Lattice. Graphs Comb. 19(4): 505-516 (2003) - [j38]Iiro S. Honkala, Antoine Lobstein:
On Identification in ZZ2 Using Translates of Given Patterns. J. Univers. Comput. Sci. 9(10): 1204-1219 (2003) - 2002
- [j37]Iiro S. Honkala, Antoine Lobstein:
On the complexity of the identification problem in Hamming spaces. Acta Informatica 38(11/12): 839-845 (2002) - [j36]Iiro S. Honkala:
Triple systems for identifying quadruples. Australas. J Comb. 25: 303- (2002) - [j35]Iiro S. Honkala, Tero Laihonen
On strongly identifying codes. Discret. Math. 254(1-3): 191-205 (2002) - [j34]Iiro S. Honkala, Antoine Lobstein:
On the Density of Identifying Codes in the Square Lattice. J. Comb. Theory B 85(2): 297-306 (2002) - [j33]Iiro S. Honkala, Antoine Lobstein:
On Identifying Codes in Binary Hamming Spaces. J. Comb. Theory A 99(2): 232-243 (2002) - [j32]Iiro S. Honkala, Andrew Klapper:
Multicovering Bounds from Relative Covering Radii. SIAM J. Discret. Math. 15(2): 228-234 (2002) - [j31]Sanna M. Ranto
Two families of optimal identifying codes in binary Hamming spaces. IEEE Trans. Inf. Theory 48(5): 1200-1203 (2002) - 2001
- [j30]Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
General Bounds for Identifying Codes in Some Infinite Regular Graphs. Electron. J. Comb. 8(1) (2001) - [j29]Iiro S. Honkala, Andrew Klapper:
Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers. Des. Codes Cryptogr. 23(2): 131-146 (2001) - [j28]Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto:
On Codes Identifying Sets of Vertices in Hamming Spaces. Des. Codes Cryptogr. 24(2): 193-204 (2001) - [j27]Uri Blass, Iiro S. Honkala, Simon Litsyn:
Bounds on identifying codes. Discret. Math. 241(1-3): 119-128 (2001) - [j26]Iiro S. Honkala, Tero Laihonen
Codes for Strong Identification. Electron. Notes Discret. Math. 6: 262-270 (2001) - [j25]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) - [c7]Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn:
On the Identification of Vertices and Edges Using Cycles. AAECC 2001: 308-314 - 2000
- [j24]Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
Bounds for Codes Identifying Vertices in the Hexagonal Grid. SIAM J. Discret. Math. 13(4): 492-504 (2000)
1990 – 1999
- 1999
- [j23]Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor:
New Bounds for Codes Identifying Vertices in Graphs. Electron. J. Comb. 6 (1999) - [j22]Alexei E. Ashikhmin, Iiro S. Honkala, Tero Laihonen
On relations between covering radius and dual distance. IEEE Trans. Inf. Theory 45(6): 1808-1816 (1999) - [j21]Iiro S. Honkala, Tero Laihonen
The probability of undetected error can have several local maxima. IEEE Trans. Inf. Theory 45(7): 2537-2539 (1999) - [c6]Uri Blass, Iiro S. Honkala, Simon Litsyn:
On tHe Size of Identifying Codes. AAECC 1999: 142-147 - [c5]Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor:
On identifying codes. Codes and Association Schemes 1999: 97-109 - 1998
- [j20]Iiro S. Honkala:
Combinatorial lower bounds on binary codes with covering radius one. Ars Comb. 50 (1998) - [c4]Iiro S. Honkala, Andrew Klapper:
Multicovering Radii of Reed-Muller Codes and the Existence of Secure Stream Ciphers (Extended Abstract). SETA 1998: 254-262 - 1997
- [j19]Iiro S. Honkala, Tero Laihonen
On Covering Radius and Discrete Chebyshev Polynomials. Appl. Algebra Eng. Commun. Comput. 8(5): 395-401 (1997) - [j18]Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Patrick Solé:
Long packing and covering codes. IEEE Trans. Inf. Theory 43(5): 1617-1619 (1997) - 1996
- [j17]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
- [j16]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. Discret. Math. 8(2): 196-207 (1995) - [j15]Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, H. F. Mattson Jr.:
Weighted coverings and packings. IEEE Trans. Inf. Theory 41(6): 1856-1867 (1995) - [c3]Iiro S. Honkala, Simon Litsyn, Aimo Tietäväinen:
On Algebraic Methods in Covering Radius Problems. AAECC 1995: 21-32 - 1994
- [j14]Iiro S. Honkala:
On (q, 1)-subnormal q-ary Covering Codes. Discret. Appl. Math. 52(3): 213-221 (1994) - [j13]Iiro S. Honkala:
On the normality of multiple covering codes. Discret. Math. 125(1-3): 229-239 (1994) - 1993
- [j12]Heikki O. Hämäläinen, Iiro S. Honkala, Markku K. Kaikkonen, Simon Litsyn:
Bounds for Binary Multiple Covering Codes. Des. Codes Cryptogr. 3(3): 251-275 (1993) - [j11]Tuvi Etzion, Gadi Greenberg, Iiro S. Honkala:
Normal and abnormal codes. IEEE Trans. Inf. Theory 39(4): 1453-1456 (1993) - [c2]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 - [c1]Iiro S. Honkala:
A Lower Bound on Binary Codes with Covering Radius One. Algebraic Coding 1993: 34-37 - 1992
- [j10]Iiro S. Honkala:
On lengthening of covering codes. Discret. Math. 106-107: 291-295 (1992) - 1991
- [j9]Iiro S. Honkala:
All binary codes with covering radius one are subnormal. Discret. Math. 94(3): 229-232 (1991) - [j8]Iiro S. Honkala:
Modified bounds for coveting codes. IEEE Trans. Inf. Theory 37(2): 351-365 (1991) - [j7]Iiro S. Honkala, Heikki O. Hämäläinen:
Bounds for abnormal binary codes with covering radius one. IEEE Trans. Inf. Theory 37(2): 372-375 (1991) - [j6]Iiro S. Honkala:
On (k, t) -subnormal covering codes. IEEE Trans. Inf. Theory 37(4): 1203-1206 (1991) - 1990
- [j5]Wende Chen, Iiro S. Honkala:
Lower bounds for q-ary covering codes. IEEE Trans. Inf. Theory 36(3): 664-671 (1990)
1980 – 1989
- 1988
- [j4]Iiro S. Honkala:
Lower bounds for binary covering codes. IEEE Trans. Inf. Theory 34(2): 326-329 (1988) - [j3]Iiro S. Honkala, Heikki O. Hämäläinen:
A new construction for covering codes. IEEE Trans. Inf. Theory 34(5): 1343-1344 (1988) - 1987
- [j2]Iiro S. Honkala, Heikki O. Hämäläinen, Markku K. Kaikkonen:
Some lower bounds for constant weight codes. Discret. Appl. Math. 18(1): 95-98 (1987) - 1985
- [j1]Iiro S. Honkala, Heikki O. Hämäläinen, Markku K. Kaikkonen:
A modification of the Zinoviev lower bound for constant weight codes. Discret. Appl. Math. 11(3): 307-310 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: