On the Size of Identifying Codes, Lecture Notes in Computer Science, issue.1719, pp.142-147, 1999. ,
DOI : 10.1007/3-540-46796-3_14
On binary codes for identification, Journal of Combinatorial Designs, vol.69, issue.2, pp.151-156, 2000. ,
DOI : 10.1002/(SICI)1520-6610(2000)8:2<151::AID-JCD8>3.0.CO;2-S
Bounds on identifying codes, Discrete Mathematics, vol.241, issue.1-3, pp.119-128, 2001. ,
DOI : 10.1016/S0012-365X(01)00113-3
Discriminating codes in bipartite graphs, Electronic Notes in Discrete Mathematics, vol.26, pp.29-35, 2006. ,
DOI : 10.1016/j.endm.2006.08.005
Lobstein: Discriminating codes in (bipartite) planar graphs, European Journal of Combinatorics ,
Computational results on identifying t-codes, 1999. ,
Improved Upper Bounds on Binary Identifying Codes, IEEE Transactions on Information Theory, vol.53, issue.11 ,
DOI : 10.1109/TIT.2007.907434
Vaiana: Location with dominating sets, Congressus Numerantium, vol.151, pp.129-144, 2001. ,
On the complexity of the identification problem in Hamming spaces, Acta Informatica, vol.38, issue.11-12, pp.839-845, 2002. ,
DOI : 10.1007/s00236-002-0093-4
On a new class of codes for identifying vertices in graphs, IEEE Transactions on Information Theory, vol.44, issue.2, pp.599-611, 1998. ,
DOI : 10.1109/18.661507
Identifying and locating-dominating codes in binary Hamming spaces, 2007. ,