**Chapter 12**

**References**

[1] Kötter R, Kschischang FR. Coding for errors and erasures in random network

*Probability, Combinatorics and Control*

coding. IEEE Transactions on Information Theory. 2008;**54**(8)

[2] Garcia A, Stichtenoth H. On the asymptotic behaviour of some towers of function fields over finite fields. Journal of Number Theory. 1996;**61**(2):248-273

[3] Geil O, Martin S, Martínez-Peas U, Ruano D. Refined analysis of RGHWs of

code pairs coming from Garcia-Stichtenoth's second tower. In: Proceedings of 21st Conference on Applications of Computer Algebra

[4] Bezzateev SV, Shekhunova NA. Subclass of cyclic Goppa codes. IEEE Transactions on Information Theory.

[5] Niederreiter H, Xing C, Lam KY. A new construction of algebraic-geometry

[6] Hachenberger D, Niederreiter H, Xing C. Function field codes. Applicable Algebra in Engineering, Communication and Computing. 2008;**19**:201-211

[7] Couvreur A, Márquez I, Pellikaan R. A polynomial time attack against algebraic geometry code based public key cryptosystems. arXiv:1401.6025

[8] Bezzateev SV, Shekhunova N. Class of generalized Goppa codes perfect in weighted hamming metric. Des. Codes

Criptogr. 2013;**66**:391-399

**270**

codes. Applicable Algebra in Engineering, Communication and Computing. 1999;**9**:373-381

Nov. 2013;**59**(11)

Moments of the Discounted Aggregate Claims with Delay Inter-Occurrence Distribution and Dependence Introduced by a FGM Copula

*Franck Adékambi*
