Convolutional Codes Over Rings

Convolutional codes over rings behave quite differently from convolutional codes over fields, but they are the ones best suited for phase modulation. This behavior depends strongly on the structure of the underlying ring. Some basic concepts about ring convolutional codes, in particular over Zpr , and their structural properties such as basicity, systematicity, non-catastrophicity and minimality, is presented. Moreover, we describe a technique of constructing ring convolutional codes from linear block codes. Given a linear block code over the Galois ring GR(4,m) with a k×n generator matrix and minimum Hamming distance d, a rate-k/n convolutional code over the ring Z4 with memory at most m − 1 and squared Euclidean free distance at least 2d is constructed.

[1]  D. W. Hagelbarger,et al.  Recurrent codes: Easily mechanized, burst-correcting, binary codes , 1959 .

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

[3]  Toby Berger,et al.  Coding for noisy channels with input-dependent insertions , 1977, IEEE Trans. Inf. Theory.

[4]  D. Segal ALGEBRA: (Graduate Texts in Mathematics, 73) , 1982 .

[5]  Patrice Rabizzoni Relation between the minimum weight of a linear code over GF(qm) and its q-art image over GF(q) , 1988, Coding Theory and Applications.

[6]  J. L. Massey,et al.  Convolutional codes over rings , 1989 .

[7]  James L. Massey,et al.  SYSTEMATICITY AND ROTATIONAL INVARIANCE OF CONVOLUTIONAL CODES OVER RINGS , 1990 .

[8]  Desmond P. Taylor,et al.  Trellis-coded continuous-phase frequency-shift keying with ring convolutional codes , 1994, IEEE Trans. Inf. Theory.

[9]  Thomas Mittelholzer Convolutional codes over rings and the two chain conditions , 1997, Proceedings of IEEE International Symposium on Information Theory.

[10]  Emma Wittenmark An Encounter with Convolutional Codes over Rings , 1998 .

[11]  Rolf Johannesson,et al.  Some Structural Properties of Convolutional Codes over Rings , 1998, IEEE Trans. Inf. Theory.

[12]  Rolf Johannesson,et al.  Two 16-State, Rate R = 2/4 Trellis Codes Whose Free Distances Meet the Heller Bound , 1998, IEEE Trans. Inf. Theory.

[13]  Marcus Greferath,et al.  Gray isometries for finite chain rings and a nonlinear ternary (36, 312, 15) code , 1999, IEEE Trans. Inf. Theory.

[14]  L. H. Lee New Rate-1 / 2 Transparent Convolutional Codes over Ring Z 8 for 8-PSK Signals , 2001 .

[15]  Sandro Zampieri,et al.  System-theoretic properties of convolutional codes over rings , 2001, IEEE Trans. Inf. Theory.

[16]  Srijidtra Mahapakulchai,et al.  Design of ring convolutional trellis codes for MAP decoding of MPEG-4 images , 2004, IEEE Transactions on Communications.

[17]  Patrick Solé,et al.  Quaternary Convolutional Codes From Linear Block Codes Over Galois Rings , 2007, IEEE Transactions on Information Theory.