Publications of Sanna Ranto

    Refereed journal papers

  1. Iiro Honkala, Tero Laihonen, Sanna Ranto. On codes identifying sets of vertices in Hamming spaces, Designs, Codes and Cryptography, 24 (2):193-204, 2001.
  2. Sanna Ranto, Iiro Honkala, Tero Laihonen. Two families of optimal identifying codes in binary Hamming spaces, IEEE Transactions on Information Theory, 48(5):1200-1203, 2002.
  3. Iiro Honkala, Tero Laihonen, Sanna Ranto. On strongly identifying codes, Discrete Mathematics, 254:191-205, 2002.
  4. Tero Laihonen, Sanna Ranto. Families of optimal codes for strong identification, Discrete Applied Mathematics, 121:203-213, 2002.
  5. Sanna Ranto, Optimal linear identifying codes, IEEE Transactions on Information Theory, 49(6):1544-1547, 2003.
  6. Iiro Honkala, Tero Laihonen, and Sanna Ranto. On Locating-Dominating Codes in Binary Hamming Spaces, Journal of Discrete Mathematics and Theoretical Computer Science, 6:265-282, 2004.
  7. Geoffrey Exoo, Tero Laihonen, Sanna Ranto. Improved upper bounds on binary identifying codes, IEEE Transactions on Information Theory, 53(11):4255-4260, 2007.
  8. Geoffrey Exoo, Tero Laihonen, Sanna Ranto. New bounds on binary identifying codes, Discrete Applied Mathematics 156:2250-2262, 2008.
  9. Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna Ranto. Locating vertices using codes, Congressus Numerantium, 191:143-159, 2008.
  10. Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna Ranto. Upper bounds for binary identifying codes, Advances in Applied Mathematics, 42:277-289, 2009.
  11. Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna Ranto. Improved bounds on identifying codes in binary Hamming spaces, European Journal of Combinatorics, 31:813-827, 2010.
  12. Sanna Ranto. On binary linear r-identifying codes, Designs, Codes and Cryptography, 60(1):81-89, 2011.
  13. Sylvain Gravier, Svante Janson, Tero Laihonen, Sanna Ranto. Graphs where every $k$-subset of vertices is an identifying set. Discrete Mathematics & Theoretical Computer Science, 16(1), 2014. pdf

Refereed conference papers

  • Iiro Honkala, Tero Laihonen, Sanna Ranto. Codes for strong identification, WCC 2001 International Workshop on Coding and Cryptography, Paris, France. Electronic Notes for Discrete Mathematics, vol 6, 2001.
  • Tero Laihonen, Sanna Ranto. Codes identifying sets of vertices, In S.? Boztas, I.?Shparlinski (eds), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2001, Melbourne, Australia, 2001), volume 2227 of Lecture Notes in Computer Science, pages 82-91, Springer, 2001.
  • Tero Laihonen, Sanna Ranto. Codes identifying sets of binary words with large radii, in the proceedings of International Workshop on Coding and Cryptography, WCC 2007, pages 215-224, INRIA, France, 2007.
  • Geoffrey Exoo, Tero Laihonen, Sanna Ranto. Improved identifying codes in F_2^n, in the proceedings of IEEE International Symposium on Information Theory, ISIT 2007, pages 1021-1025, Nice, France, 2007.
  • Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna Ranto. Improved bounds on binary identifying codes, in the proceedings of 2008 IEEE International Symposium on Information Theory, ISIT 2008, pages 629-633, Toronto, Canada, 2008.
  • Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna Ranto. Constructions for identifying codes, in the proceedings of 11th International Workshop on Algebraic and Combinatorial Coding Theory, ACCT 2008, pages 92-98, Pamporovo, Bulgaria, 2008.
  • Dissertation

  • Sanna Ranto. Identifying and locating-dominating codes in binary Hamming spaces, TUCS Dissertation No. 86, 2007. [abstract][pdf]


    Back to the main page