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