Sanna M. Ranto

15 papers B 2Journal 12Unranked 1
YearRankTypeTitle / Venue / Authors
2011 J jnl
On binary linear
Des. Codes Cryptogr.
Sanna M. Ranto
2010 J jnl
Improved bounds on identifying codes in binary Hamming spaces.
Eur. J. Comb.
Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto
2009 J jnl
Upper bounds for binary identifying codes.
Adv. Appl. Math.
Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto
2008 B conf
Improved bounds on binary identifying codes.
ISIT
Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto
2008 J jnl
New bounds on binary identifying codes.
Discret. Appl. Math.
Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto
2007 B conf
Improved Identifying Codes in F2
ISIT
Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto
2007 J jnl
Improved Upper Bounds on Binary Identifying Codes.
IEEE Trans. Inf. Theory
Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto
2004 J jnl
On Locating-Dominating Codes in Binary Hamming Spaces.
Discret. Math. Theor. Comput. Sci.
Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
2003 J jnl
Optimal linear identifying codes.
IEEE Trans. Inf. Theory
Sanna M. Ranto
2002 J jnl
Families of optimal codes for strong identification.
Discret. Appl. Math.
Tero Laihonen, Sanna M. Ranto
2002 J jnl
On strongly identifying codes.
Discret. Math.
Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
2002 J jnl
Two families of optimal identifying codes in binary Hamming spaces.
IEEE Trans. Inf. Theory
Sanna M. Ranto, Iiro S. Honkala, Tero Laihonen
2001 — conf
Codes Identifying Sets of Vertices.
AAECC
Tero Laihonen, Sanna M. Ranto
2001 J jnl
Codes for Strong Identification.
Electron. Notes Discret. Math.
Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
2001 J jnl
On Codes Identifying Sets of Vertices in Hamming Spaces.
Des. Codes Cryptogr.
Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto