C. Aguilar-melchor, N. Aragon, P. Barreto, S. Bettaieb, L. Bidoux et al., BIKE. First round submission to the NIST post-quantum cryptography call, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01671903

C. Aguilar-melchor, N. Aragon, S. Bettaieb, L. Bidoux, O. Blazy et al., , 2017.

C. Aguilar-melchor, N. Aragon, S. Bettaieb, L. Bidoux, O. Blazy et al., Rank quasi cyclic (RQC). First round submission to the NIST post-quantum cryptography call, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01946894

M. Albrecht, C. Cid, K. G. Paterson, C. J. Tjhai, and M. Tomlinson, NTS-KEM. First round submission to the NIST post-quantum cryptography call, 2017.

M. , More on average case vs approximation complexity, Computational Complexity, vol.20, issue.4, pp.755-786, 2011.

Y. Aubry, Algebraic geometric codes on surfaces. Unpublished, available on the author's webpage, 1992.
URL : https://hal.archives-ouvertes.fr/hal-00979000

Y. Aubry, Reed-Muller codes associated to projective algebraic varieties, Coding theory and algebraic geometry, vol.1518, pp.4-17, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00973776

Y. Aubry and M. Perret, Coverings of singular curves over finite fields, Manuscripta Math, vol.88, issue.1, pp.467-478, 1995.
URL : https://hal.archives-ouvertes.fr/hal-00976489

B. Audoux, An application of Khovanov homology to quantum codes, Ann. Inst. Henri Poincaré D, Comb. Phys. Interact, vol.1, issue.2, pp.185-223, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01066619

B. Audoux and A. Couvreur, On tensor products of CSS codes, To appear in Annales de l'Institut Henri Poincaré D, Combinatorics, Physics and their interactions, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01248760

C. Bachoc, A. Couvreur, and G. Zémor, Towards a function field version of Freiman's theorem, Algebraic Combin, vol.1, issue.4, pp.501-521, 2018.

C. Bachoc, C. Serra, and G. Zémor, An analogue of Vosper's theorem for extension fields, Math. Proc. Philos. Soc, vol.163, pp.423-452, 2017.

C. Bachoc, O. Serra, and G. Zémor, Revisiting Kneser's theorem for field extensions, Combinatorica, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01951358

M. Baldi, M. Bianchi, F. Chiaraluce, J. Rosenthal, and D. Schipani, Enhanced public key security for the McEliece cryptosystem, J. Cryptology, vol.29, issue.1, pp.1-27, 2016.

E. Ballico, Codes coming from a blowing up of the plane, Afr. Mat, vol.24, issue.1, pp.93-96, 2013.

G. Banegas, P. S. Barreto, B. O. Boidje, P. Cayrel, G. N. Dione et al., DAGS : Key encapsulation for dyadic GS codes, 2017.

M. Bardet, É. Barelli, O. Blazy, R. Torres, A. Couvreur et al., , 2017.

E. Barelli, On the security of some compact keys for McEliece scheme, WCC Workshop on Coding and Cryptography, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01674546

E. Barelli, On the security of short McEliece keys from algebraic and algebraic geometry codes with automorphisms
URL : https://hal.archives-ouvertes.fr/tel-01993634

E. Barelli and A. Couvreur, An efficient structural attack on NIST submission DAGS, Advances in Cryptology -ASIACRYPT'18, vol.11272, pp.93-118, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01796338

A. Becker, A. Joux, A. May, and A. Meurer, Decoding random binary linear codes in 2 n/20 : How 1 + 1 = 0 improves information set decoding, Advances in Cryptology -EUROCRYPT 2012, 2012.

P. Beelen and T. Høholdt, The Decoding of Algebraic Geometry Codes, vol.5, pp.49-98, 2008.

T. P. Berger, P. Cayrel, P. Gaborit, and A. Otmani, Reducing key length of the McEliece cryptosystem, Progress in Cryptology -AFRICACRYPT 2009, vol.5580, pp.77-97, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01081727

T. P. Berger and P. Loidreau, How to mask the structure of codes for a cryptographic use, Des. Codes Cryptogr, vol.35, issue.1, pp.63-79, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00068424

E. Berlekamp, R. Mceliece, and H. Van-tilborg, On the inherent intractability of certain coding problems, IEEE Trans. Inform. Theory, vol.24, issue.3, pp.384-386, 1978.

D. J. Bernstein, T. Chou, T. Lange, I. Maurich, R. Niederhagen et al., Classic McEliece : conservative code-based cryptography, 2017.

D. J. Bernstein, T. Lange, C. Peters, and . Wild-mceliece, Selected Areas in Cryptography, vol.6544, pp.143-158, 2010.

D. J. Bernstein, T. Lange, and C. Peters, Wild McEliece Incognito, LNCS, vol.7071, pp.244-254, 2011.

A. Beutelspacher, Blocking sets and partial spreads in finite projective spaces, Geom. Dedicata, vol.9, issue.4, pp.425-449, 1980.

R. Blache, A. Couvreur, E. Hallouin, D. Madore, J. Nardi et al., Anticanonical codes from del Pezzo surfaces with Picard rank one, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02075926

W. Bosma, J. Cannon, and C. Playoust, The Magma algebra system I : The user language, J. Symbolic Comput, vol.24, issue.3/4, pp.235-265, 1997.

T. Bouganis, Error correcting codes over algebraic surfaces, Applied algebra, algebraic algorithms and error-correcting codes, vol.2643, pp.169-179, 2003.

S. Bravyi and M. B. Hastings, Homological product codes, Proceedings of the 46th annual ACM symposium on theory of computing, STOC '14, pp.273-282, 2014.

R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Phys. Rev. A, vol.54, pp.1098-1098, 1996.

A. Canteaut and F. Chabaud, A new algorithm for finding minimum-weight words in a linear code : Application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511, IEEE Trans. Inform. Theory, vol.44, issue.1, pp.367-378, 1998.

I. Cascudo, R. Cramer, D. Mirandola, and G. Zémor, Squares of random linear codes, IEEE Trans. Inform. Theory, vol.61, issue.3, pp.1159-1173, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01261390

I. M. Chakravarti, The generalized Goppa codes and related discrete designs from Hermitian surfaces in P G(3, s 2 ), Coding Theory and Applications, pp.116-124, 1988.

I. V. Chizhov and M. A. Borodin, Effective attack on the McEliece cryptosystem based on Reed-Muller codes, Discrete Math. Appl, vol.24, issue.5, pp.273-280, 2014.

D. Coggia and A. Couvreur, On the security of a Loidreau's rank metric code based encryption scheme, WCC 2019 -Workshop on Coding Theory and Cryptography, 2019.

N. Courtois, M. Finiasz, and N. Sendrier, How to achieve a McEliece-based digital signature scheme, Advances in Cryptology -ASIACRYPT, vol.2248, pp.157-174, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00072511

A. Couvreur, Construction of rational surfaces yielding good codes, Finite Fields Appl, vol.17, issue.5, pp.424-441, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00547454

A. Couvreur, Incidence structures from the blown-up plane and LDPC codes, IEEE Trans. Inform. Theory, vol.57, issue.7, pp.4401-4416, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00540023

A. Couvreur, Codes and the Cartier Operator, Proc. Amer. Math. Soc, vol.142, 1983.
URL : https://hal.archives-ouvertes.fr/hal-00710451

A. Couvreur, An upper bound on the number of rational points of arbitrary projective varieties over finite fields, Proc. Amer. Math. Soc, vol.144, pp.3671-3685, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01069510

A. Couvreur, Notes de cours, disponibles sur le site, 2018.

A. Couvreur, N. Delfosse, and G. Zémor, A construction of quantum LDPC codes from cayley graphs, IEEE Trans. Inform. Theory, vol.59, issue.9, pp.6087-6098, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00632257

A. Couvreur and I. Duursma, Evaluation codes from smooth quadric surfaces and twisted Segre varieties, Des. Codes Cryptogr, vol.66, issue.1, pp.291-303, 2013.
URL : https://hal.archives-ouvertes.fr/inria-00611801

A. Couvreur, P. Gaborit, V. Gauthier-umaña, A. Otmani, and J. Tillich, Distinguisherbased attacks on public-key cryptosystems using Reed-Solomon codes, Des. Codes Cryptogr, vol.73, issue.2, pp.641-666, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01096172

A. Couvreur, M. Lequesne, and J. Tillich, Recovering short secret keys of RLCE in polynomial time, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01959617

A. Couvreur, I. Márquez-corbella, and R. Pellikaan, Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes, Presented at the 4th International Castle Meeting on Coding Theory and Applications (4ICMCTA), 2014.
URL : https://hal.archives-ouvertes.fr/hal-01069272

A. Couvreur, I. Márquez-corbella, and R. Pellikaan, A polynomial time attack against algebraic geometry code based public key cryptosystems, Proc. IEEE Int. Symposium Inf. Theory -ISIT 2014, pp.1446-1450, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00937476

A. Couvreur, I. Márquez-corbella, and R. Pellikaan, Cryptanalysis of McEliece cryptosystem based on algebraic geometry codes and their subcodes, IEEE Trans. Inform. Theory, vol.63, issue.8, pp.5404-5418, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01280927

A. Couvreur, A. Otmani, and J. Tillich, New identities relating wild Goppa codes, Finite Fields Appl, vol.29, pp.178-197, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00880994

A. Couvreur, A. Otmani, and J. Tillich, Polynomial time attack on wild McEliece over quadratic extensions, Advances in Cryptology -EURO-CRYPT 2014, vol.8441, pp.17-39, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01661935

A. Couvreur, A. Otmani, and J. Tillich, Polynomial time attack on wild McEliece over quadratic extensions, IEEE Trans. Inform. Theory, vol.63, issue.1, pp.404-427, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01661935

A. Couvreur, A. Otmani, J. Tillich, and V. Gauthier-umaña, A polynomial-time attack on the BBCRS scheme, LNCS, vol.9020, pp.175-193, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01104078

J. Davis, Algebraic geometric codes on anticanonical surfaces, J. Pure Appl. Algebra, vol.215, issue.4, pp.496-510, 2011.

P. Delsarte, On subfield subcodes of modified Reed-Solomon codes, IEEE Trans. Inform. Theory, vol.21, issue.5, pp.575-576, 1975.

A. Duc and S. Vaudenay, HELEN : A public-key cryptosystem based on the LPN and the decisional minimal distance problems, Progress in Cryptology -AFRICACRYPT 2013, vol.7918, pp.107-126, 2013.

I. Dumer, Two decoding algorithms for linear codes, Probl. Inf. Transm, vol.25, issue.1, pp.17-23, 1989.

I. M. Duursma and R. Pellikaan, A symmetric Roos bound for linear codes, J. Combin. Theory Ser. A, vol.113, issue.8, pp.1677-1688, 2006.

F. A. Edoukou, Codes defined by forms of degree 2 on Hermitian surfaces and Sørensen's conjecture, Finite Fields Appl, vol.13, issue.3, pp.616-627, 2007.

F. A. Edoukou, Codes defined by forms of degree 2 on quadric surfaces, IEEE Trans. Inform. Theory, vol.54, issue.2, pp.860-864, 2008.

F. A. Edoukou, Codes defined by forms of degree 2 on quadrics in P 4 (F q ), Arithmetic, Geometry, Cryptography and Coding Theory, vol.487, 2009.

J. Faugère, V. Gauthier, A. Otmani, L. Perret, and J. Tillich, A distinguisher for high rate McEliece cryptosystems, Proc. IEEE Inf. Theory Workshop-ITW 2011, pp.282-286, 2011.

J. Faugère, A. Otmani, L. Perret, F. De-portzamparc, and J. Tillich, Folding alternant and Goppa Codes with non-trivial automorphism groups, IEEE Trans. Inform. Theory, vol.62, issue.1, pp.184-198, 2016.

J. Faugère, A. Otmani, L. Perret, and J. Tillich, Algebraic cryptanalysis of McEliece variants with compact keys, Advances in Cryptology -EUROCRYPT 2010, vol.6110, pp.279-298, 2010.

J. Faugère, L. Perret, F. De-portzamparc, ;. Kaoshiung, and R. O. Taiwan, Algebraic attack against variants of McEliece with Goppa polynomial of a special form, Advances in Cryptology -ASIACRYPT 2014, vol.8873, pp.21-41, 2014.

C. Faure and L. Minder, Cryptanalysis of the McEliece cryptosystem over hyperelliptic curves, Proceedings of the eleventh International Workshop on Algebraic and Combinatorial Coding Theory, pp.99-107, 2008.

G. Feng and T. R. Rao, Decoding algebraic-geometric codes up to the designed minimum distance, IEEE Trans. Inform. Theory, vol.39, issue.1, pp.37-45, 1993.

M. H. Freedman, D. A. Meyer, and F. Luo, Z 2 -systolic freedom and quantum codes. In Mathematics of quantum computation, Comput. Math. Ser, pp.287-320, 2002.

P. Gaborit, Shorter keys for code based cryptography, Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), pp.81-91, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00078726

R. G. Gallager, Low Density Parity Check Codes, 1963.

A. Garcia and H. Stichtenoth, A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vl?du? bound, Invent. Math, vol.121, pp.211-222, 1995.

S. R. Ghorpade and G. Lachaud, Étale cohomology, Lefschetz theorems and number of points of singular varieties over finite fields, Mosc. Math. J, vol.2, issue.3, pp.589-631, 2002.

V. D. Goppa, Codes on algebraic curves, Dokl. Akad. Nauk SSSR, vol.259, issue.6, pp.1289-1290, 1981.

M. , Bounds on the minimum distance of linear codes and quantum codes, pp.2019-2020, 2007.

V. Guruswami and M. Sudan, Improved decoding of Reed-Solomon and algebraic-geometry codes, IEEE Trans. Inform. Theory, vol.45, issue.6, pp.1757-1767, 1999.

J. P. Hansen, Toric surfaces and error-correcting codes, Coding theory, cryptography and related areas, pp.132-142, 1998.

S. H. Hansen, Error-correcting codes from higher-dimensional varieties, Finite Fields Appl, vol.7, issue.4, pp.531-552, 2001.

R. Hartshorne, Algebraic geometry, Graduate Texts in Mathematics, vol.52, 1977.

J. Hirschfeld, Finite Projective Spaces of Three Dimensions. Oxford mathematical monographs, 1985.

T. Høholdt and R. Pellikaan, On the decoding of algebraic-geometric codes, IEEE Trans. Inform. Theory, issue.6, pp.1589-1614, 1995.

M. Homma and S. J. Kim, Sziklai's conjecture on the number of points of a plane curve over a finite field iii. Finite Fields and Their Applications, 2010.

X. Hou, K. H. Leung, and Q. Xiang, A generalization of an addition theorem of Kneser, J. Number Theory, vol.97, pp.1-9, 2002.

Y. Ihara, Some remarks on the number of rational points of algebratic curves over finite fields, J. Math. Sci. Univ. Tokyo, vol.28, issue.3, pp.721-724, 1982.

H. Janwa and O. Moreno, McEliece public key cryptosystems using algebraic-geometric codes, Des. Codes Cryptogr, vol.8, issue.3, pp.293-307, 1996.

D. , Maximal partial spreads and translation nets of small deficiency, J. Algebra, vol.90, issue.1, pp.119-132, 1984.

D. , Maximal partial spreads and transversal-free translation nets, J. Combin. Theory Ser. A, vol.62, issue.1, pp.66-92, 1993.

G. L. Katsman and M. A. Tsfasman, A remark on algebraic geometric codes, Representation theory, group rings, and coding theory, vol.93, pp.197-199, 1989.

K. Khuri-makdisi, Linear algebra algorithms for divisors on an algebraic curve, Math. Comp, vol.73, issue.245, pp.333-357, 2004.

K. Khuri-makdisi, Asymptotically fast group operations on Jacobians of general curves, Math. Comp, vol.76, issue.260, pp.2213-2239, 2007.

A. Y. Kitaev, Fault-tolerant quantum computation by anyons, Ann. Physics, vol.303, issue.1, pp.2-30, 2003.

M. Kneser, Summenmengen in lokalkompakten abelesche Gruppen, Math. Z, vol.66, pp.88-110, 1956.

G. Lachaud, Projective Reed-Muller codes, Coding theory and applications, vol.311, pp.125-129, 1986.

G. Lachaud and R. Rolland, On the number of points of algebraic sets over finite fields, J. Pure Appl. Algebra, vol.219, pp.5117-5136, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01165404

P. J. Lee and E. F. Brickell, An observation on the security of McEliece's public-key cryptosystem, Advances in Cryptology -EUROCRYPT'88, vol.330, pp.275-280, 1988.

J. B. Little, Algebraic geometry codes from higher-dimensional varieties, Advances in Algebraic Geometry codes, pp.257-293, 2008.

C. C. Lomont, Error correcting codes on algebraic surfaces, pp.309123-309124, 2003.

D. J. Mackay, G. Mitchison, and A. Shokrollahi, More sparse-graph codes for quantum errorcorrection, 2007.

D. J. Mackay and R. M. Neal, Near shannon limit performance of low density parity check codes, Electronics Letters, vol.32, pp.1645-1646, 1996.

F. J. Macwilliams and N. J. Sloane, The Theory of Error-Correcting Codes, 1986.

Y. I. Manin, of North-Holland Mathematical Library, vol.4

Y. I. Manin and S. G. Vl?duts, Linear codes and modular curves, Current problems in mathematics, vol.25, pp.209-257, 1984.

I. Márquez-corbella and R. Pellikaan, Error-correcting pairs for a public-key cryptosystem, CBC 2012, Code-based Cryptography Workshop, 2012.

A. May, A. Meurer, and E. Thomae, Decoding random linear codes in O(2 0.054n ), Advances in Cryptology -ASIACRYPT 2011, vol.7073, pp.107-124, 2011.

A. May and I. Ozerov, On computing nearest neighbors with applications to decoding of binary linear codes, Advances in Cryptology -EUROCRYPT 2015, vol.9056, pp.203-228, 2015.

R. J. Mceliece, A Public-Key System Based on Algebraic Coding Theory, pp.114-116, 1978.

K. Metsch and L. Storme, Partial t-spreads in P G(2t + 1, q), Des. Codes Cryptogr, vol.18, issue.1-3, pp.199-216, 1999.

L. Minder, Cryptography based on error correcting codes, 2007.

L. Minder and A. Shokrollahi, Cryptanalysis of the Sidelnikov cryptosystem, Advances in Cryptology -EUROCRYPT 2007, vol.4515, pp.347-360, 2007.

D. Mirandola and G. Zémor, Critical pairs for the product Singleton bound, IEEE Trans. Inform. Theory, vol.61, issue.9, pp.4928-4937, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01261399

R. Misoczki, J. Tillich, N. Sendrier, and P. S. Barreto, MDPC-McEliece : New McEliece variants from moderate density parity-check codes, Proc. IEEE Int. Symposium Inf. Theory -ISIT, pp.2069-2073, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00870929

D. I. Mumford-;-c and . Ciclo, Varieties defined by quadratic equations, Questions on algebraic varieties, pp.29-100, 1969.

H. Niederreiter, Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory, vol.15, pp.159-166, 1986.

M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information, 2010.

A. Otmani, J. Tillich, and L. Dallot, Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes, Special Issues of Mathematics in Computer Science, vol.3, issue.2, pp.129-140, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01083566

R. Overbeck and N. Sendrier, Code-based cryptography, Post-quantum cryptography, pp.95-145, 2009.

R. Pellikaan, On decoding linear codes by error correcting pairs, 1988.

E. Prange, The use of information sets in decoding cyclic codes, IRE Transactions on Information Theory, vol.8, issue.5, pp.5-9, 1962.

H. Randriambololona, On products and powers of linear codes under componentwise multiplication, Algorithmic arithmetic, geometry, and coding theory, vol.637, pp.3-78, 2015.
URL : https://hal.archives-ouvertes.fr/hal-02287120

T. Richardson, A. Shokrollahi, and R. Urbanke, Design of capacity-approaching irregular lowdensity parity check codes, IEEE Trans. Inform. Theory, vol.47, pp.619-637, 2001.

T. Richardson and R. Urbanke, Modern Coding Theory, 2008.

E. Rieffel and W. Polak, An introduction to quantum computation for non-physicists. ArXiv :quant-ph/9809016v2, 2000.

J. Rosenkilde, Power decoding Reed-Solomon codes up to the Johnson radius, Advances in Mathematics of Communications, vol.12, issue.1, pp.81-106, 2018.

D. Ruano, On the parameters of r-dimensional toric codes, Finite Fields Appl, vol.13, issue.4, pp.962-976, 2007.

G. Schmidt, V. Sidorenko, and M. Bossert, Decoding reed-solomon codes beyond half the minimum distance using shift-register synthesis, 2006 IEEE International Symposium on Information Theory, pp.459-463, 2006.

N. Sendrier, On the structure of a randomly permuted concatenated code, EUROCODE'94, pp.169-173, 1994.

N. Sendrier, Decoding one out of many, Post-Quantum Cryptography, vol.7071, pp.51-67, 2011.

J. Serre, M. Lettreà, . Tsfasman, and . Astérisque, Journées Arithmétiques, p.1989, 1991.

I. R. Shafarevich, Basic algebraic geometry, vol.1, 1994.

P. W. Shor, Algorithms for quantum computation : Discrete logarithms and factoring, pp.124-134, 1994.

V. M. Sidelnikov, A public-key cryptosytem based on Reed-Muller codes, Discrete Math. Appl, vol.4, issue.3, pp.191-207, 1994.

V. M. Sidelnikov and S. Shestakov, On the insecurity of cryptosystems based on generalized Reed-Solomon codes, Discrete Math. Appl, vol.1, issue.4, pp.439-444, 1992.

A. N. Skorobogatov and S. G. Vl?du?, On the decoding of algebraic-geometric codes, IEEE Trans. Inform. Theory, vol.36, issue.5, pp.1051-1060, 1990.

A. Steane, Multiple particle interference and quantum error correction, Proc. Roy. Soc. Lond. A, vol.452, pp.2551-2551, 1996.

J. Stern, A method for finding codewords of small weight, Coding Theory and Applications, vol.388, pp.106-113, 1988.

H. Stichtenoth, On the dimension of subfield subcodes, IEEE Trans. Inform. Theory, vol.36, issue.1, pp.90-93, 1990.

H. Stichtenoth, Algebraic function fields and codes, Graduate Texts in Mathematics, vol.254, 2009.

K. Stöhr and J. F. Voloch, Weierstrass points and curves over finite fields, Proc. London Math. Soc, pp.1-19, 1986.

M. Sudan, Decoding of Reed Solomon codes beyond the error-correction bound, J. Complexity, vol.13, issue.1, pp.180-193, 1997.

Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, Further results on Goppa codes and their applications to constructing efficient binary codes, IEEE Trans. Inform. Theory, vol.22, pp.518-526, 1976.

P. Sziklai, A bound on the number of points of a plane curve, Finite Fields Appl, vol.14, issue.1, pp.41-43, 2008.

R. M. Tanner, A recursive approach to low complexity codes, IEEE Trans. Inform. Theory, vol.27, issue.5, pp.533-547, 1981.

T. Tao and V. Vu, Additive combinatorics, volume 105 of Cambridge Stud, Adv. Math, 2006.

J. Tillich, The decoding failure probability of MDPC codes. preprint, Sept, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01957037

J. Tillich and G. Zémor, Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength, IEEE Trans. Inform. Theory, vol.60, issue.2, pp.1193-1202, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00931764

M. A. Tsfasman, S. G. Vl?duts, and T. Zink, Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound, Mathematische Nachrichten, vol.109, issue.1, pp.21-28, 1982.

J. H. Van-lint, Introduction to Coding Theory, 1982.

O. Viro, Remarks on definition of khovanov homology, 2002.

S. G. Vl?du? and V. G. , Drinfel'd. Number of points of an algebraic curve, Funct. Anal. Appl, vol.17, issue.1, pp.53-54, 1983.

J. F. Voloch and M. Zarzar, Algebraic geometric codes on surfaces, Arithmetics, geometry, and coding theory (AGCT 2005), vol.21, pp.211-216, 2010.

C. Voss and H. Stichtenoth, Asymptotically good families of subfield subcodes of geometric Goppa codes, Geometriae Dedicata, vol.33, issue.1, pp.111-116, 1990.

Y. Wang, Quantum resistant random linear code based public key encryption scheme RLCE, Proc. IEEE Int. Symposium Inf. Theory -ISIT 2016, pp.2519-2523, 2016.

Y. Wang and . Rlce-kem, First round submission to the NIST post-quantum cryptography call, 2017.

C. A. Weibel, An introduction to homological algebra, of Cambridge Studies in Advanced Mathematics, vol.38, 1994.

C. Wieschebrink, Two NP-complete problems in coding theory with an application in code based cryptography, Proc. IEEE Int. Symposium Inf. Theory -ISIT, pp.1733-1737, 2006.

C. Wieschebrink, Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes, Post-Quantum Cryptography, vol.6061, pp.61-72, 2010.

M. Wirtz, On the parameters of Goppa codes, Coding techniques and coding theory, vol.34, pp.1341-1343, 1988.

A. Yamada, E. Eaton, K. Kalach, P. Lafrance, and A. Parent, QC-MDPC KEM. First round submission to the NIST post-quantum cryptography call, 2017.

M. Zarzar, Error-correcting codes on low rank surfaces, Finite Fields Appl, vol.13, issue.4, pp.727-737, 2007.