• 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

Articles in journals (37):

• Geoffrey Exoo, Ville Junnila, Tero Laihonen, Locating-Dominating Codes in Cycles. Australasian Journal of Combinatorics 49, 177–194, 2011.
• Ville Junnila, Tero Laihonen, Identification in Z^2 Using Euclidean Balls. Discrete Applied Mathematics 159, 335–343, 2011.
• Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna Ranto, Improved Bounds on Identifying Codes in Binary Hamming Spaces. European Journal of Combinatorics 31(3), 2010.
• Iiro Honkala, Tero Laihonen, On Vertex-Robust Identifying Codes of Level Three. Ars Combinatoria 94, 115–127, 2010.
• Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna Ranto, Upper Bounds for Binary Identifying Codes. Advances in Applied Mathematics 42(3), 277–289, 2009.
• Svante Janson, Tero Laihonen, On the Size of Identifying Codes in Binary Hypercubes. Journal of Combinatorial Theory Series A 116(5), 1087–1096, 2009.
• Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna Ranto, Locating vertices using codes. Congressus Numerantium (191), 143-159, 2008.
• Geoffrey Exoo, Tero Laihonen, Sanna Ranto, New Bounds on Binary Identifying Codes. Discrete Applied Mathematics 156(12), 2250–2263, 2008.
• 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.
• Tero Laihonen, On Cages Admitting Identifying Codes. European Journal of Combinatorics 29(3), 737–741, 2008.
• Tero Laihonen, Julien Moncel, On Graphs Admitting Codes Identifying Sets of Vertices. Australasian Journal of Combinatorics 41, 81–91, 2008.
• Geoffrey Exoo, Tero Laihonen, Sanna Ranto, Improved upper bounds on binary identifying codes. IEEE Transactions on Information Theory 53(11), 4255–4260, 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, Tero Laihonen, On Locating-Dominating Sets in Infinite Grids. European Journal of Combinatorics 27(2), 218–227, 2006.
• Tero Laihonen, Optimal t-Edge-Robust r-Identifying Codes in the King Lattice. Graphs and Combinatorics 22(4), 487–496, 2006.
• Tero Laihonen, On Robust Identification in the Square and King Grids. Discrete Applied Mathematics 154(17), 2499–2510, 2006.
• Tero Laihonen, On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes. SIAM Journal on Discrete Mathematics 18(4), 825–834, 2005.
• 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, Tero Laihonen, On the Identification of Sets of Points in the Square Lattice. Discrete and Computational Geometry 29, 139–152, 2003.
• Iiro Honkala, Tero Laihonen, Sanna Ranto, On Strongly Identifying Codes. Discrete Mathematics 254, 191–205, 2002.
• Tero Laihonen, Optimal Codes for Strong Identification. European Journal of Combinatorics , 2002.
• Tero Laihonen, Sanna Ranto, Families of Optimal Codes for Strong Identification. Discrete Applied Mathematics 121, 203–213, 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.
• Iiro Honkala, Tero Laihonen, Virheitä havaitsevista koodeista. Arkhimedes 3, 20-25, 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.
• Tero Laihonen, Sequences of Optimal Identifying Codes. IEEE Transactions on Information Theory , , 2001.
• 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.
• Iiro Honkala, Tero Laihonen, The probability of undetected error can have several local maxima. IEEE Transactions on Information Theory 45(7), 2537–2539, 1999.
• Tero Laihonen, Simon Litsyn, New bounds on covering radius as a function of dual distance. SIAM Journal on Discrete Mathematics 12(2), 243–251, 1999.
• Tero Laihonen, Simon Litsyn, On upper bounds for minimum distance and covering radius of non-binary codes. Designs, Codes and Cryptography 14(1), 71-80, 1998.
• Cunsheng Ding, Tero Laihonen, Ari Renvall, Linear multisecret-sharing schemes and error-correcting codes. Journal of Universal Computer Science 3(9), 1023–1036, 1997.
• Iiro Honkala, Tero Laihonen, Simon Litsyn, On Covering Radius and Discrete Chebyshev Polynomials. Applicable Algebra in Engineering Communication and Computing 8(5), 395–401, 1997.

Articles in proceedings (11):

• Ville Junnila, Tero Laihonen, Codes for Identification in Z^2 with Euclidean Balls. In: The International Workshop on Coding and Cryptography, 298-310, 2009.
• Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna Ranto, Constructions for identifying codes. In: Proceedings of 11th International Workshop on Algebraic and Combinatorial Coding Theory, 92-98, 2008.
• Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna Ranto, Improved bounds on binary identifying codes. In: Proceedings of 2008 IEEE International Symposium on Information Theory, 629-633, 2008.
• Iiro Honkala, Tero Laihonen, Sanna Ranto, Codes for strong identification. In: Electronic Notes in Discrete Mathematics, 6, Elsevier Science, 2001.
• Tero Laihonen, Sanna Ranto, Codes identifying sets of vertices. In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Melbourne, Australia, 2001), Lecture Notes in Computer Science 2227, 82–91, Springer, 2001.
• Iiro Honkala, Tero Laihonen, On the probability of undetected error. In: 2000 IEEE International Symposium on Information Theory, 254, 2000.
• Alexei Ashikhmin, Iiro Honkala, Tero Laihonen, Simon Litsyn, Improved estimates on covering radius. In: 1999 IEEE Information Theory and Communications Workshop, 123, 1999.
• Tero Laihonen, On the covering radius of a binary code. In: Seventh Nordic Combinatorial Conference (Turku, August, 1999), TUCS General Publication, 57-63, TUCS, 1999.
• Tero Laihonen, On covering radius and dual distance. In: 1998 Information Theory Workshop, 53-54, 1998.
• Tero Laihonen, Covering radius of self-complementary codes and BCH codes. In: 1998 IEEE International Symposium on Information Theory, 434, 1998.
• Iiro Honkala, Tero Laihonen, Simon Litsyn, Covering radius and discrete Chebyshev polynomials. In: 1997 IEEE International Symposium on Information Theory, 365, 1997.

Ph.D. thesis (1):

• Tero Laihonen, Estimates on the Covering Radius When the Dual Distance is Known. TUCS Dissertations 11. Turku Centre for Computer Science, 1998.

Licenciate thesis (1):

• Tero Laihonen, Covering radius and dual distance. 1996.