L. Babai, P. Codenotti, J. A. Grochow, and Y. , Qiao: Code equivalence and group isomorphism, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1395-1408, 2011.

A. Betten, M. Braun, H. Fripertinger, A. Kerber, A. Kohnert et al., Error-Correcting Linear Codes: Classification by Isometry and Applications, Algorithms and Computation in Mathematics, vol.18, 2006.

I. Bouyukliev, About the code equivalence. Ser. Coding Theory Cryptol, pp.126-151, 2007.

L. E. Danielsen and M. G. Parker, Edge local complementation and equivalence of binary linear codes, Designs, Codes and Cryptography, vol.69, issue.2, pp.161-170, 2008.
DOI : 10.1007/s10623-008-9190-x

H. Dinh, C. Moore, and A. Russell, McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks, Proceedings of the 31st annual conference on Advances in cryptology, pp.761-779, 2011.
DOI : 10.1007/978-3-642-22792-9_43

T. Feulner, The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes, Advances in Mathematics of Communications, vol.3, issue.4, pp.363-383, 2009.
DOI : 10.3934/amc.2009.3.363

T. Feulner, Kanonische reprsentantenäquivalenterreprsentantenäquivalenter codes computergesttzte berechnung und ihre anwendung in der codierungstheorie, kryptographie und geometrie, 2013.

H. Fripertinger, Enumeration of linear codes by applying methods from algebraic combinatorics, Grazer Math. Ber, vol.328, pp.31-42, 1996.

H. Fripertinger, Enumeration of the semilinear isometry classes of linear codes, Bayrether Mathematische Schriften, vol.74, pp.100-122, 2005.

H. Fripertinger and A. Kerber, Isometry classes of indecomposable linear codes, Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pp.194-204, 1995.
DOI : 10.1007/3-540-60114-7_15

M. Girault, A (non-practical) three-pass identification protocol using coding theory, Advances in Cryptology AUSCRYPT '90, pp.265-272, 1990.
DOI : 10.1007/BFb0030367

J. A. Grochow, Matrix lie algebra isomorphism Also available as arXiv:1112.2012, IEEE Conference on Computational Complexity, 2011.

W. C. Huffman, Codes and groups, Handbook of Coding Theory, pp.1345-1440, 1998.

P. Kaski and P. R. Ostergård, Classification Algorithms for Codes and Designs, Algorithms and Computation in Mathematics, vol.15, 2006.

J. S. Leon, Computing automorphism groups of error-correcting codes, IEEE Transactions on Information Theory, vol.28, issue.3, pp.496-511, 1982.
DOI : 10.1109/TIT.1982.1056498

R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia of Mathematics and its Applications, vol.20, 1997.
DOI : 10.1017/CBO9780511525926

F. J. Macwilliams, Error-Correcting Codes for Multiple-Level Transmission, Bell System Technical Journal, vol.40, issue.1, pp.281-308, 1961.
DOI : 10.1002/j.1538-7305.1961.tb03986.x

R. J. Mceliece and P. R. Ostergård, A public-key cryptosystem based on algebraic coding theory Classifying subspaces of hamming spaces, California Institute of Technology Des. Codes Cryptography, vol.19, issue.27, pp.297-305, 1978.

E. Petrank and R. M. Roth, Is code equivalence easy to decide?, IEEE Transactions on Information Theory, vol.43, issue.5, pp.1602-1604, 1997.
DOI : 10.1109/18.623157

E. M. Rains and N. J. Sloane, Self-dual codes, pp.177-294, 1998.

N. Sendrier, On the Dimension of the Hull, SIAM Journal on Discrete Mathematics, vol.10, issue.2, pp.282-293, 1997.
DOI : 10.1137/S0895480195294027
URL : https://hal.archives-ouvertes.fr/inria-00074009

N. Sendrier, Finding the permutation between equivalent linear codes: the support splitting algorithm, IEEE Transactions on Information Theory, vol.46, issue.4, pp.1193-1203, 2000.
DOI : 10.1109/18.850662

N. Sendrier and D. E. Simos, The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography, PQCrypto '13: Proceedings of the Fifth International Conference on Post-Quantum Cryptography, pp.203-216, 2013.
DOI : 10.1007/978-3-642-38616-9_14

C. Sims, Computational methods in the study of permutation groups, Computational Problems in Abstract Algebra, pp.169-183, 1970.

G. Skersys, Calcul du groupe d'automorphisme des codes. détermination de l' equivalence des codes, Thèse de doctorat, 1999.

D. Vertigan, Bicycle Dimension and Special Points of the Tutte Polynomial, Journal of Combinatorial Theory, Series B, vol.74, issue.2, pp.378-396, 1998.
DOI : 10.1006/jctb.1998.1860