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 a...

Space-time block codes provide substantial diversity advantages for multiple transmit antenna systems at a low decoding complexity. In this paper, we concatenate space-time codes with Convolutional Codes (CC), Turbo Convolutional codes (TC), Turbo BCH codes (TBCH), Trellis Coded Modulation (TCM) and Turbo Trellis Coded Modulation (TTCM) schemes for achieving a high coding gain. The associated p...

We provide useful results on two classes of convolutional codes: binary codes and nonbinary codes. The best codes or the best known codes for these two classes of convolutional codes are found by computer search. Some of them are better than those found in the past. We specify these codes by their transfer function matrices, distance spectra, and information-weight spectra. Furthermore, we deri...

We give a general method to construct MDS one-dimensional convolutional codes. Our method generalizes previous constructions [5]. Moreover we give a classification of one-dimensional Convolutional Goppa Codes and propose a characterization of MDS codes of this type. Introduction One of the main problems in coding theory is the construction of codes with a large distance, such as so-called MDS c...

Turbo codes are usually constructed using systematic recursive convolutional codes (SRCC’s) as constituent codes. In this paper, we introduce a new class of turbo codes that uses nonsystematic recursive convolutional codes (NSRCC’s) as constituent codes. A systematic constituent code then becomes a particular case of this more general class. The use of this larger class of constituent codes enh...

In this correspondence the error exponent and the decoding complexity of binary woven convolutional codes with outer warp and with binary convolutional codes as outer and inner codes are studied. It is shown that an error probability that is exponentially decreasing with the product of the outer and inner code memories can be achieved with a nonexponentially increasing decoding complexity.

A double serially concatenated code with two interleaves consists of the cascade of an outer encoder, an interleaver permuting the outer codeword bits, a middle encoder, another interleaver permuting the middle codeword bits and an inner encoder whose input words are the permuted middle codewords. The construction can be generalized to h cascaded encoders separated by h – 1 interleavers, where ...