Bounds on identifying codes, Discrete Mathematics, vol.241, issue.1-3, pp.119-128, 2001. ,
DOI : 10.1016/S0012-365X(01)00113-3
URL : http://doi.org/10.1016/s0012-365x(01)00113-3
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
Identifying and locating-dominating codes: NP-completeness results for directed graphs, IEEE Transactions on Information Theory, vol.48, issue.8, pp.2192-2200, 2002. ,
DOI : 10.1109/TIT.2002.800490
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard, Theoretical Computer Science, vol.290, issue.3, pp.2109-2120, 2003. ,
DOI : 10.1016/S0304-3975(02)00536-4
Lobstein: Covering Codes, 1997. ,
New bounds for codes identifying vertices in graphs, Electronic Journal of Combinatorics, vol.6, issue.1, 1999. ,
On identifying codes, Codes and Association Schemes, Proceedings of the DIMACS Workshop on Codes and Association Schemes, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 56, pp.97-109, 2001. ,
Fundamentals of Domination in Graphs, 1998. ,
On codes identifying sets of vertices in Hamming spaces. Designs, Codes and Cryptography, pp.193-204, 2001. ,
On Identifying Codes in Binary Hamming Spaces, Journal of Combinatorial Theory, Series A, vol.99, issue.2, pp.232-243, 2002. ,
DOI : 10.1006/jcta.2002.3263
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
Sequences of optimal identifying codes, IEEE Transactions on Information Theory, vol.48, issue.3, pp.774-776, 2002. ,
DOI : 10.1109/18.986043
Codes Identifying Sets of Vertices, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Proceedings of AAECC-14, pp.82-91, 2001. ,
DOI : 10.1007/3-540-45624-4_9
URL : https://hal.archives-ouvertes.fr/hal-00182323
Table of constant weight binary codes ,
On location?domination numbers for certain classes of graphs, Congressus Numerantium, vol.45, pp.97-106, 1984. ,
Optimal linear identifying codes, IEEE Transactions on Information Theory, vol.49, issue.6, pp.1544-1547, 2003. ,
DOI : 10.1109/TIT.2003.810657
Two families of optimal identifying codes in binary Hamming spaces, IEEE Transactions on Information Theory, vol.48, issue.5, pp.1200-1203, 2002. ,
DOI : 10.1109/18.995650
Dominating and reference sets in a graph, Journal Mathematical and Physical Sciences, vol.22, pp.445-455, 1988. ,
Locating dominating sets and locating-dominating sets, Graph Theory, Combinatorics and Applications: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs, pp.1073-1079, 1995. ,
Fault-tolerant locating-dominating sets, Discrete Mathematics, vol.249, issue.1-3, pp.179-189, 2002. ,
DOI : 10.1016/S0012-365X(01)00244-8
Improved sphere bounds on the covering radius of codes, IEEE Transactions on Information Theory, vol.34, issue.2, pp.237-245, 1988. ,
DOI : 10.1109/18.2632