27 December 2005 in IEEE Transactions on Information Theory
In this correspondence, we define convolutional Goppa codes over algebraic curves and construct their corresponding dual codes. Examples over the projective line and over elliptic curves are described, obtaining in particular some maximum-distance separable (MDS) convolutional codes.
1 January 2010 in Advances in Mathematics of Communications
An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be corrected. The algorithm can be efficiently used on a particular class of convolutional codes, known as doubly cyclic convolutional codes. Due to their highly algebraic structure those codes are well suited for the algorithm and the main step of the procedure can be carried out using Reed-Solomon decoding. Examples illustrate the decoding and a comparison with existing algorithms is made.
9 April 2013 in IEEE Transactions on Information Theory
We show that the free distance, as a function on a space parameterizing a family of convolutional codes, is a lower semicontinuous function and that, therefore, the property of being maximum distance separable (MDS) is an open condition. For a class of convolutional codes, an algorithm is offered to compute the free distance. The behavior of the free distance by enlargements of the alphabet and by increasing the length is also studied. As an application, the algebraic equations characterizing the subfamily of MDS codes are explicitly computed for families of 1-D convolutional Goppa codes.
1 January 2009 in Advances in Mathematics of Communications
We present the family of generalized AG convolutional codes, constructed by using algebraic geometric tools. This construction extends block generalized AG codes on the one hand and several algebraic constructions of convolutional codes on the other. The tools employed to define these codes are also used to obtain information about their parameters and to determine conditions such that the resulting codes have optimal free distance.
1 May 2010 in Linear Algebra and its Applications
25 June 2013 in IEEE Transactions on Information Theory
Convolutional Goppa codes (CGC) were defined in Appl. Algebra Eng. Comm. Comput., vol. 15, pp. 51-61, 2004 and IEEE Trans. Inf. Theory, vol. 52, 340-344, 2006. In this paper, we prove that every convolutional code is a CGC defined over a smooth curve over \BBF q(z) and we give an explicit construction of convolutional codes as CGC over the projective line \BBP \BBF q(z)1. We characterize which convolutional codes are defined by a complete linear system over curves of genus 0, 1, and over hyperelliptic curves. We apply these results to provide detailed constructions of some linear block codes as Goppa codes.