Sanna M. Ranto

Orcid: 0000-0002-8351-9873

According to our database1, Sanna M. Ranto authored at least 16 papers between 2001 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2014
Graphs where every k-subset of vertices is an identifying set.
Discret. Math. Theor. Comput. Sci., 2014

2011
On binary linear <i>r</i>-identifying codes.
Des. Codes Cryptogr., 2011

2010
Improved bounds on identifying codes in binary Hamming spaces.
Eur. J. Comb., 2010

2009
Upper bounds for binary identifying codes.
Adv. Appl. Math., 2009

2008
New bounds on binary identifying codes.
Discret. Appl. Math., 2008

Improved bounds on binary identifying codes.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Improved Upper Bounds on Binary Identifying Codes.
IEEE Trans. Inf. Theory, 2007

Improved Identifying Codes in F2<sup>n</sup>.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2004
On Locating-Dominating Codes in Binary Hamming Spaces.
Discret. Math. Theor. Comput. Sci., 2004

2003
Optimal linear identifying codes.
IEEE Trans. Inf. Theory, 2003

2002
Two families of optimal identifying codes in binary Hamming spaces.
IEEE Trans. Inf. Theory, 2002

On strongly identifying codes.
Discret. Math., 2002

Families of optimal codes for strong identification.
Discret. Appl. Math., 2002

2001
Codes for Strong Identification.
Electron. Notes Discret. Math., 2001

On Codes Identifying Sets of Vertices in Hamming Spaces.
Des. Codes Cryptogr., 2001

Codes Identifying Sets of Vertices.
Proceedings of the Applied Algebra, 2001


  Loading...