• HOME
• ABOUT US
  • Organization
  • Personnel
• NEWS&EVENTS
  • News & Events archive
  • Newsletter archive
  • Conference archive
  • Travel reports
• COOPERATION
  • International Involvement
  • National Involvement
  • Regional Involvement
• EDUCATION
  • Master's Programmes
  • TUCS Graduate Programmes
  • Information for Students
  • Courses
  • TUCS Short Courses
• PUBLICATIONS
  • TUCS Publication Series
  • How to Publish in TUCS Series
  • Publication Search
  • Publication Graph
  • Publication Input
  • Publication Input Guide
  • JuFo Browser
• RESEARCH
  • Focus areas
  • Research Programmes
  • Research Units
  • Distinguished Lectures

Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search

• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Department: Any ÅAU / Department of Information Technologies UTU / Department of Information Technology UTU / Department of Mathematics and Statistics UTU / Turku School of Economics, Institute of Information Systems Sciences

Research Unit: Any Algorithmics and Computational Intelligence Group (ACI) Biomathematics Research Unit (BIOMATH) Communication Systems (ComSys) Computational Biomodeling Laboratory (Combio Lab) Data Mining and Knowledge Management Laboratory Distributed Systems Laboratory (DS Lab) Embedded Computer and Electronic Systems (ECES) Embedded Systems Laboratory (ESLAB) FUNDIM, Fundamentals of Computing and Discrete Mathematics Institute for Advanced Management Systems Research (IAMSR) Learning and Reasoning Lab Software Construction Laboratorium Software Development Laboratory (SwDev) Software Engineering Laboratory (SE Lab) Turku BioNLP Group Turku Optimization Group (TOpGroup) UTU Information Systems Science (ISS)

Publication type: Any Monographs Edited books Edited special issues of journals Edited proceedings Articles in journals Articles in proceedings Chapters in edited books Ph.D. thesis Lic. thesis Technical reports

Lastname, Firstname Year Title Abstract Keyword Points AND Lastname, Firstname Year Title Abstract Keyword Points AND Lastname, Firstname Year Title Abstract Keyword Points AND Lastname, Firstname Year Title Abstract Keyword Points AND Lastname, Firstname Year Title Abstract Keyword Points

Sort output by publication type Sort output by publication year

and display below and download in BibTeX and download as CSV and download as 2014-CSV

Monographs (2):

• Ian Anderson, Iiro Honkala, A Short Course in Combinatorial Designs. Internet edition, 41 pp., 1997.
• Gérard Cohen, Iiro Honkala, Simon Litsyn, Antoine Lobstein, Covering Codes. North-Holland Mathematical Library, Elsevier, 1997.

Articles in journals (55):

• Iiro Honkala, An Optimal Strongly Identifying Code in the Infinite Triangular Grid. Electronic Journal of Combinatorics 17, no. 1, 2010.
• Iiro Honkala, Tero Laihonen, On Vertex-Robust Identifying Codes of Level Three. Ars Combinatoria 94, 115–127, 2010.
• David Auger, Irène Charon, Iiro Honkala, Olivier Hudry, Antoine Lobstein, Edge Number, Minimum Degree, Maximum Independent Set, Radius and Diameter in Twin-Free Graphs. Advances in Mathematics of Communications 3, 97–114, 2009.
• Paul Dorbec, Sylvain Gravier, Iiro Honkala, Michel Mollard, Weighted Perfect Codes in Lee Metric. Electronic Notes in Discrete Mathematics 34, 477–481, 2009.
• Paul Dorbec, Sylvain Gravier, Iiro Honkala, Michel Mollard, Weighted Codes in Lee Metrics. Designs Codes and Cryptography 52, 1022–1025, 2009.
• Iiro Honkala, On r-Locating-Dominatings Sets in Paths. European Journal of Combinatorics 30, 1022–1025, 2009.
• Iiro Honkala, Tero Laihonen, On Identifying Codes in the King Grid That Are Robust Against Edge Deletions. Electronic Journal of Combinatorics 15, no. 1, 2008.
• Iréne Charon, Iiro Honkala, Olivier Hudry, Antoine Lobstein, Structural Properties of Twin-Free Graphs. Electronic Journal of Combinatorics 14, no. 1, 2007.
• Iiro Honkala, Tero Laihonen, On Identifying Codes That Are Robust Against Edge Changes. Information and Computation 205, 1078–1095, 2007.
• Iiro Honkala, Tero Laihonen, On a New Class of Identifying Codes in Graphs. Information Processing Letters 102, 92–98, 2007.
• Iiro Honkala, An Optimal Locating-Dominating Set in the Infinite Triangular Grid. Discrete Mathematics 306(21), 2670–2681, 2006.
• Iiro Honkala, A Family of Optimal Identifying Codes in Z^2. Journal of Combinatorial Theory Series A 113(8), 1760–1763, 2006.
• Iiro Honkala, On 2-Edge-Robust r-Identifying Codes in the King Grid. Australasian Journal of Combinatorics 36, 151–165, 2006.
• Iiro Honkala, Mark Karpovsky, Lev Levitin, On Robust and Dynamic Identifying Codes. IEEE Transactions on Information Theory 52(2), 599–612, 2006.
• Iiro Honkala, Tero Laihonen, On Locating-Dominating Sets in Infinite Grids. European Journal of Combinatorics 27(2), 218–227, 2006.
• Irène Charon, Iiro Honkala, Olivier Hudry, Antoine Lobstein, The Minimum Density of an Identifying Code in the King Lattice. Discrete Mathematics 276, 95–109, 2004.
• Iiro Honkala, An Optimal Robust Identifying Code in the Triangular Lattice. Annals of Combinatorics 8, 303–323, 2004.
• Iiro Honkala, Tero Laihonen, On Identification in the Triangular Grid. Journal of Combinatorial Theory Series B 91, 67–86, 2004.
• Iiro Honkala, Tero Laihonen, On Identifying Codes in the Triangular and Square Grids. SIAM Journal on Computing 33, 304–312, 2004.
• Iiro Honkala, Tero Laihonen, On Identifying Codes in the Hexagonal Mesh. Information Processing Letters 89, 9–14, 2004.
• Iiro Honkala, Tero Laihonen, Sanna Ranto, On Locating-Dominating Codes in Binary Hamming Spaces. Discrete Mathematics and Theoretical Computer Science 6, 265–282, 2004.
• Iiro Honkala, Mark Karpovsky, Simon Litsyn, Cycles for Identifying Vertices and Edges in Binary Hypercubes and 2-Dimensional Tori. Discrete Applied Mathematics 129, 409–419, 2003.
• Iiro Honkala, Tero Laihonen, On the Identification of Sets of Points in the Square Lattice. Discrete and Computational Geometry 29, 139–152, 2003.
• Iiro Honkala, Antoine Lobstein, On Identification in Z² Using Translates of Given Patterns. Journal of Universal Computer Science 9, 1204–1219, 2003.
• Iiro Honkala, Triple Systems for Identifying Quadruples. Australasian Journal of Combinatorics , 303–316, 2002.
• Iiro Honkala, Andrew Klapper, Multicovering Bounds from Relative Covering Radii. SIAM Journal on Discrete Mathematics 15(2), 228–234, 2002.
• Iiro Honkala, Tero Laihonen, Sanna Ranto, On Strongly Identifying Codes. Discrete Mathematics 254, 191–205, 2002.
• Iiro Honkala, Antoine Lobstein, On Identifying Codes in Binary Hamming Spaces. Journal of Combinatorial Theory Series A 99, 232–243, 2002.
• Iiro Honkala, Antoine Lobstein, On the Complexity of the Identification Problem in Hamming Spaces. Acta Informatica 38, 839–845, 2002.
• Iiro Honkala, Antoine Lobstein, On the Density of Identifying Codes in the Square Lattice. Journal of Combinatorial Theory Series B 85, 297–306, 2002.
• Sanna Ranto, Iiro Honkala, Tero Laihonen, Two Families of Optimal Identifying Codes in Binary Hamming Spaces. IEEE Transactions on Information Theory 48(5), 1200–1203, 2002.
• Uri Blass, Iiro Honkala, Mark Karpovsky, Simon Litsyn, Short Dominating Paths and Cycles in the Binary Hypercubes. Annals of Combinatorics 5, 51–59, 2001.
• Uri Blass, Iiro Honkala, Simon Litsyn, Bounds on identifying codes. Discrete Mathematics 241(1), 119–128, 2001.
• Irène Charon, Iiro Honkala, Olivier Hudry, Antoine Lobstein, General bounds for identifying codes in some infinite regular graphs. Electronic Journal of Combinatorics , R39, 2001.
• Gérard Cohen, Iiro Honkala, Antoine Lobstein, On codes identifying vertices in the two-dimensiona. IEEE Transactions on Computers 50, 174–176, 2001.
• Iiro Honkala, Tero Laihonen, Virheitä havaitsevista koodeista. Arkhimedes 3, 20-25, 2001.
• Iiro Honkala, Andrew Klapper, Bounds for the Multicovering Radii of Reed-Muller Code. Designs Codes and Cryptography 23, 131–145, 2001.
• Iiro Honkala, Tero Laihonen, On the probability of undetected error for binary codes used for combined correction and detection. Journal of Discrete Mathematical Sciences & Cryptography 4, 189-197, 2001.
• Iiro Honkala, Tero Laihonen, Sanna Ranto, On Codes Identifying Sets of Vertices in Hamming Spaces. Designs Codes and Cryptography 24(2), 193–204, 2001.
• Uri Blass, Iiro Honkala, Simon Litsyn, On binary codes for identification. Journal of Combinatorial Designs 8(2), 151–156, 2000.
• Gérard Cohen, Iiro Honkala, Antoine Lobstein, Bounds for codes identifying vertices in the hexagona. SIAM Journal on Discrete Mathematics 13, 492–504, 2000.
• Alexei Ashikhmin, Iiro Honkala, Tero Laihonen, Simon Litsyn, On relations between covering radius and dual distance. IEEE Transactions on Information Theory 45(6), 1808–1816, 1999.
• 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 6, Comment to paper R19, 1999.
• Gérard Cohen, Iiro Honkala, Antoine Lobstein, Gilles Zémor, New bounds for codes identifying vertices in graphs. Electronic Journal of Combinatorics 6(1), R19, 1999.
• Iiro Honkala, Tero Laihonen, The probability of undetected error can have several local maxima. IEEE Transactions on Information Theory 45(7), 2537–2539, 1999.
• Iiro Honkala, Combinatorial lower bounds for binary codes with covering radius one. Ars Combinatoria 50, 149–159, 1998.
• Gérard Cohen, Iiro Honkala, Simon Litsyn, Patrick Sole, Long packing and covering codes. IEEE Transactions on Information Theory 43(5), 1617–1619, 1997.
• Iiro Honkala, Yrjö Kaipainen, Aimo Tietäväinen, Long Binary Narrow-Sense BCH Codes Are Normal. Applicable Algebra in Engineering Communication and Computing 8(1), 49–55, 1997.