The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Tero Laihonen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tero Laihonen, Sanna M. Ranto
    Codes Identifying Sets of Vertices. [Citation Graph (0, 0)][DBLP]
    AAECC, 2001, pp:82-91 [Conf]
  2. Iiro S. Honkala, Tero Laihonen, Simon Litsyn
    On Covering Radius and Discrete Chebyshev Polynomials. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:5, pp:395-401 [Journal]
  3. Tero Laihonen, Sanna M. Ranto
    Families of optimal codes for strong identification. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:121, n:1-3, pp:203-213 [Journal]
  4. Tero Laihonen
    On robust identification in the square and king grids. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:17, pp:2499-2510 [Journal]
  5. Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
    On Codes Identifying Sets of Vertices in Hamming Spaces. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:24, n:2, pp:193-204 [Journal]
  6. Tero Laihonen, Simon Litsyn
    On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:14, n:1, pp:71-80 [Journal]
  7. Iiro S. Honkala, Tero Laihonen
    On the Identification of Sets of Points in the Square Lattice. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:29, n:1, pp:139-152 [Journal]
  8. Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
    On strongly identifying codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:191-205 [Journal]
  9. Iiro S. Honkala, Tero Laihonen
    On locating-dominating sets in infinite grids. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:2, pp:218-227 [Journal]
  10. Tero Laihonen
    Optimal Codes for Strong Identification. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:3, pp:307-313 [Journal]
  11. Iiro S. Honkala, Tero Laihonen
    Codes for Identification in the King Lattice. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:4, pp:505-516 [Journal]
  12. Iiro S. Honkala, Tero Laihonen
    On identifying codes in the hexagonal mesh. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:1, pp:9-14 [Journal]
  13. Iiro S. Honkala, Tero Laihonen
    On a new class of identifying codes in graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:2-3, pp:92-98 [Journal]
  14. Iiro S. Honkala, Tero Laihonen
    On identification in the triangular grid. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:67-86 [Journal]
  15. Cunsheng Ding, Tero Laihonen, Ari Renvall
    Linear Multisecret-Sharing Schemes and Error-Correcting Codes. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1997, v:3, n:9, pp:1023-1036 [Journal]
  16. Iiro S. Honkala, Tero Laihonen
    On identifying codes in the triangular and square grids. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:304-312 [Journal]
  17. Tero Laihonen
    On Optimal Edge-Robust and Vertex-Robust (1, leql)-Identifying Codes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:18, n:4, pp:825-834 [Journal]
  18. Tero Laihonen, Simon Litsyn
    New Bounds On Covering Radius as a Function of Dual Distance. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:2, pp:243-251 [Journal]
  19. Alexei E. Ashikhmin, Iiro S. Honkala, Tero Laihonen, Simon Litsyn
    On relations between covering radius and dual distance. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:1808-1816 [Journal]
  20. Iiro S. Honkala, Tero Laihonen
    The probability of undetected error can have several local maxima. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2537-2539 [Journal]
  21. Tero Laihonen
    Sequences of optimal identifying codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:3, pp:774-776 [Journal]
  22. Sanna M. Ranto, Iiro S. Honkala, Tero Laihonen
    Two families of optimal identifying codes in binary Hamming spaces. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:5, pp:1200-1203 [Journal]
  23. Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
    On Locating-Dominating Codes in Binary Hamming Spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2004, v:6, n:2, pp:265-282 [Journal]
  24. Iiro S. Honkala, Tero Laihonen
    On identifying codes that are robust against edge changes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:7, pp:1078-1095 [Journal]

  25. New bounds on binary identifying codes. [Citation Graph (, )][DBLP]


  26. On cages admitting identifying codes. [Citation Graph (, )][DBLP]


  27. Improved bounds on identifying codes in binary Hamming spaces. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002