Codes Identifying Sets of Vertices. - Tero Laihonen; Sanna M. Ranto (AAECC, 2001)

On Codes Identifying Sets of Vertices in Hamming Spaces. - Iiro S. Honkala; Tero Laihonen; Sanna M. Ranto (Des. Codes Cryptogr., 2001)

Codes for Strong Identification. - Iiro S. Honkala; Tero Laihonen; Sanna M. Ranto (Electron. Notes Discret. Math., 2001)

Families of optimal codes for strong identification. - Tero Laihonen; Sanna M. Ranto (Discret. Appl. Math., 2002)

On strongly identifying codes. - Iiro S. Honkala; Tero Laihonen; Sanna M. Ranto (Discret. Math., 2002)

Two families of optimal identifying codes in binary Hamming spaces. - Sanna M. Ranto; Iiro S. Honkala; Tero Laihonen (IEEE Trans. Inf. Theory, 2002)

Optimal linear identifying codes. - Sanna M. Ranto (IEEE Trans. Inf. Theory, 2003)

On Locating-Dominating Codes in Binary Hamming Spaces. - Iiro S. Honkala; Tero Laihonen; Sanna M. Ranto (Discret. Math. Theor. Comput. Sci., 2004)

Improved Identifying Codes in F2n. - Geoffrey Exoo; Tero Laihonen; Sanna M. Ranto (ISIT, 2007)

Improved Upper Bounds on Binary Identifying Codes. - Geoffrey Exoo; Tero Laihonen; Sanna M. Ranto (IEEE Trans. Inf. Theory, 2007)

Improved bounds on binary identifying codes. - Geoffrey Exoo; Ville Junnila; Tero Laihonen; Sanna M. Ranto (ISIT, 2008)

New bounds on binary identifying codes. - Geoffrey Exoo; Tero Laihonen; Sanna M. Ranto (Discret. Appl. Math., 2008)

Upper bounds for binary identifying codes. - Geoffrey Exoo; Ville Junnila; Tero Laihonen; Sanna M. Ranto (Adv. Appl. Math., 2009)

Improved bounds on identifying codes in binary Hamming spaces. - Geoffrey Exoo; Ville Junnila; Tero Laihonen; Sanna M. Ranto (Eur. J. Comb., 2010)

On binary linear r-identifying codes. - Sanna M. Ranto (Des. Codes Cryptogr., 2011)

Graphs where every k-subset of vertices is an identifying set. - Sylvain Gravier; Svante Janson; Tero Laihonen; Sanna Maarit Ranto (Discret. Math. Theor. Comput. Sci., 2014)