D. Auger, Induced paths in twin-free graphs, Electron. J. Combin, vol.15, issue.17, 2008.

D. Auger, I. Charon, I. Honkala, O. Hudry, and A. Lobstein, Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs, Adv. Math. Commun, vol.3, issue.1, pp.97-114, 2009.

A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-regular graphs, Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas, 1989.

A. E. Brouwer and J. H. Van-lint, Strongly regular graphs and partial geometries, In Enumeration and design, pp.85-122, 1982.

J. Goethals and J. J. Seidel, Strongly regular graphs derived from combinatorial designs, Journal canadien de math??matiques, vol.22, issue.0, pp.597-614, 1970.
DOI : 10.4153/CJM-1970-067-9

S. Gravier and J. Moncel, Construction of codes identifying sets of vertices, Electron. J. Combin, vol.12, issue.13, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00360014

M. N. Huxley, The Distribution of Prime Numbers, 1972.

M. G. Karpovsky, K. Chakrabarty, and L. B. Levitin, 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

M. Laifenfeld and A. Trachtenberg, Identifying Codes and Covering Problems, IEEE Transactions on Information Theory, vol.54, issue.9, pp.3929-3950, 2008.
DOI : 10.1109/TIT.2008.928263

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.7461

T. Laihonen, Sequences of optimal identifying codes, IEEE Transactions on Information Theory, vol.48, issue.3, pp.774-776, 2002.
DOI : 10.1109/18.986043

T. Laihonen, On cages admitting identifying codes, European Journal of Combinatorics, vol.29, issue.3, pp.737-741, 2008.
DOI : 10.1016/j.ejc.2007.02.016

T. Laihonen and S. Ranto, Codes Identifying Sets of Vertices, Lecture Notes in Computer Science, vol.2227, pp.82-91, 2001.
DOI : 10.1007/3-540-45624-4_9

URL : https://hal.archives-ouvertes.fr/hal-00182323

A. Lobstein, Identifying and locating-dominating codes in graphs, a bibliography

F. J. Macwilliams and N. J. Sloane, The Theory of Error?Correcting Codes, 1977.

J. and S. Wallis, Hadamard matrices Combinatorics: Room squares, sum-free sets, Hadamard matrices, Lecture Notes in Mathematics, vol.292, 1972.