Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field, Lecture Notes in Comput. Sci, vol.5677, pp.466-486, 2009. ,
DOI : 10.1007/978-3-642-03356-8_28
Squares of Random Linear Codes, IEEE Transactions on Information Theory, vol.61, issue.3, pp.1159-1173, 2015. ,
DOI : 10.1109/TIT.2015.2393251
URL : https://hal.archives-ouvertes.fr/hal-01261390
Bounds on the Threshold Gap in Secret Sharing and its Applications, IEEE Transactions on Information Theory, vol.59, issue.9, pp.5600-5612, 2013. ,
DOI : 10.1109/TIT.2013.2264504
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications, IEEE Transactions on Information Theory, vol.60, issue.7, pp.3871-3888, 2014. ,
DOI : 10.1109/TIT.2014.2314099
Secure Computation from Random Error Correcting Codes, Lecture Notes in Comput. Sci, vol.4515, pp.291-310, 2007. ,
DOI : 10.1007/978-3-540-72540-4_17
Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves, Advances in cryptology? EUROCRYPT 2008, pp.451-470 ,
DOI : 10.1007/978-3-540-78967-3_26
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields, Lecture Notes in Comput. Sci, vol.4117, pp.521-536, 2006. ,
DOI : 10.1007/11818175_31
Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions, pp.1-24, 2015. ,
DOI : 10.1007/978-3-662-46803-6_11
URL : https://hal.archives-ouvertes.fr/hal-01413262
A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound, Inventiones Mathematicae, vol.84, issue.No. 1, pp.211-222, 1995. ,
DOI : 10.1007/BF01884295
On the Asymptotic Behaviour of Some Towers of Function Fields over Finite Fields, Journal of Number Theory, vol.61, issue.2, pp.248-273, 1996. ,
DOI : 10.1006/jnth.1996.0147
On asymptotically good ramp secret sharing schemes, pp.1502-05507, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01275753
Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes, IEEE Transactions on Information Theory, vol.60, issue.10, pp.5938-5949, 2014. ,
DOI : 10.1109/TIT.2014.2345375
Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.95, issue.11, pp.2067-2075, 2012. ,
DOI : 10.1587/transfun.E95.A.2067
Some New Characters on the Wire-Tap Channel of Type II, IEEE Transactions on Information Theory, vol.51, issue.3, pp.1222-1229, 2005. ,
DOI : 10.1109/TIT.2004.842763
New asymptotic metrics for relative generalized Hamming weight, 2014 IEEE International Symposium on Information Theory, pp.3142-3144, 2014. ,
DOI : 10.1109/ISIT.2014.6875413
URL : http://arxiv.org/abs/1404.0434
Weierstrass Semigroups in an Asymptotically Good Tower of Function Fields, Finite Fields and Their Applications, vol.4, issue.4, pp.381-392, 1998. ,
DOI : 10.1006/ffta.1998.0217
A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound, IEEE Transactions on Information Theory, vol.47, issue.6, pp.2225-2241, 2001. ,
DOI : 10.1109/18.945244
Geometric approach to higher weights, special issue on algebraic geometry codes, pp.1564-1588, 1995. ,
DOI : 10.1109/18.476213
The number of points of an algebraic curve, Funktsional . Anal. i Prilozhen, vol.17, issue.1, pp.68-69, 1983. ,
Generalized Hamming weights for linear codes, IEEE Transactions on Information Theory, vol.37, issue.5, pp.1412-1418, 1991. ,
DOI : 10.1109/18.133259