On Elliptic Convolutional Goppa Codes

The algebraic geometric tools used by Goppa to construct block codes with good properties have been also used successfully in the setting of convolutional codes. We present here this construction carried out over elliptic curves, yielding a variety of codes which are optimal with respect to different bounds. We provide a number of examples for different values of their parameters, including some explicit strongly MDS convolutional codes. We also introduce some conditions for certain codes of this class to be MDS.

[1]  J. M. Muñoz Porras,et al.  Convolutional Codes of Goppa Type , 2003, Applicable Algebra in Engineering, Communication and Computing.

[2]  Joachim Rosenthal,et al.  Strongly-MDS convolutional codes , 2003, IEEE Transactions on Information Theory.

[3]  V. D. Goppa.  Codes on Algebraic Curves , 1981 .

[4]  Iglesias Curto,et al.  A study of convolutional codes. Classification, new families and decoding , 2008 .

[5]  José Ignacio Iglesias Curto,et al.  Convolutional Goppa codes , 2003, IEEE Transactions on Information Theory.

[6]  Heide Gluesing-Luerssen,et al.  Distance Bounds for Convolutional Codes and Some Optimal Codes , 2003 .

[7]  G. David Forney,et al.  Convolutional codes I: Algebraic structure , 1970, IEEE Trans. Inf. Theory.

[8]  Joachim Rosenthal,et al.  Maximum Distance Separable Convolutional Codes , 1999, Applicable Algebra in Engineering, Communication and Computing.