A parallel concatenated convolutional coding scheme consists of two constituent systematic convolutional encoders linked by an interleaver. The information bits at the input of the rst encoder are scrambled by the interleaver before entering the second encoder. The codewords of the parallel concatenated code consist of the information bits followed by the parity check bits of both encoders. Par...

We address the concept of “minimal polynomial encoder” for finite support linear convolutional codes over Zpr . These codes can be interpreted as polynomial modules which enables us to apply results from the 2007-paper [8] to introduce the notions of “p-encoder” and “minimal p-encoder”. Here the latter notion is the ring analogon of a row reduced polynomial encoder from the field case. We show ...

Multidimensional convolutional codes arise as a generalization of “classical” onedimensional codes. We will introduce m-dimensional convolutional codes of length n as submodules of Dn where D is the polynomial ring in m variables over a finite field. Besides their coding theoretic significance, they can also be regarded as the annihilating modules of systems of partial difference equations, the...

The astonishing performance of concatenated codes attracted many researchers and this has resulted in an explosive amount of literature since their introduction few years ago. As concatenation between codes did not actually arise from applying a pre-existing theory, most of their outstanding features remain to be explained. This paper gives some explanation of the concatenation between Reed Sol...

Convolutional Codes P al Frenger, P al Orten, and Tony Ottosson Communication Systems Group, Department of Signals and Systems, Chalmers University of Technology, S-412 96 G oteborg, Sweden. phone: +46 31 772 1758, fax: +46 31 772 1748, email: [email protected] Abstract| In CDMA systems maximum theoretical performance can be obtained by spreading with low-rate error control codes. Previ...