Sanna Ranto
FT
sanna.ranto@utu.fi +358 29 450 2926 +358 50 325 4448 Vesilinnantie 5 Turku |
- Graphs where every k-subset of vertices is an identifying set (2014)
- Discrete Mathematics and Theoretical Computer Science
- On binary linear r-identifying codes (2011)
- Designs, Codes and Cryptography
- Improved bounds on identifying codes in binary Hamming spaces (2010)
- European Journal of Combinatorics
- Upper bounds for binary identifying codes (2009)
- Advances in Applied Mathematics
- Improved Bounds on Binary Identifying Codes (2008) Exoo G, Junnila V, Laihonen T, Ranto S
- Locating vertices using codes (2008)
- Congressus Numerantium
- New bounds on binary identifying codes (2008)
- Discrete Applied Mathematics
- Improved identifying codes in F-2(n) (2007) Exoo G, Laihonen T, Ranto S
- Improved upper bounds on binary identifying codes (2007)
- IEEE Transactions on Information Theory
- On locating-dominating codes in binary Hamming spaces (2004) Honkala I, Laihonen T, Ranto S
- Families of optimal codes for strong identification (2002)
- Discrete Applied Mathematics
- On strongly identifying codes (2002)
- Discrete Mathematics
- On codes identifying sets of vertices in Hamming spaces (2001)
- Designs, Codes and Cryptography
UTU Research Portal