Tero Laihonen
terolai@utu.fi +358 29 450 4303 +358 46 923 7614 Vesilinnantie 5 Turku |
Coding theory and graph theory
Research interests: Information retrieval in advanced memory systems and error-correcting codes, metric dimension in graphs, locating-dominating set, identifying codes
5 of 5
- Families of optimal codes for strong identification (2002)
- Discrete Applied Mathematics
- On strongly identifying codes (2002)
- Discrete Mathematics
- Optimal codes for strong identification (2002)
- European Journal of Combinatorics
- On codes identifying sets of vertices in Hamming spaces (2001)
- Designs, Codes and Cryptography
- On the probability of undetected error (2000) Honkala I, Laihonen T
- On the probability of undetected error (2000)
- IEEE International Symposium on Information Theory
- New bounds on covering radius as a function of dual distance (1999)
- Siam Journal on Discrete Mathematics
- Covering radius of self-complementary codes and BCH codes (1998) Laihonen T
- On covering radius and dual distance (1998) Laihonen T
- On covering radius and discrete Chebyshev polynomials (1997)
- Applicable Algebra in Engineering, Communication and Computing
- On covering radius and discrete Chebyshev polynomials (1997)
- Applicable Algebra in Engineering, Communication and Computing
UTU Research Portal