Serial Concatenated Convolutional Codes (SCCC) also named Turbo Codes, obtained with different constituent trellis codes are presented with a simple and quick mode of data interleaving. A SCC code has higher error-correction performances than the constituent codes. Optimal convolutional codes are deduced for SCCC. A comparison of the SCCC performances is made using weight enumerating functions.

It is well known that a convolutional code can be viewed as a linear system over a nite eld. In this paper we develop this viewpoint for convolutional codes using several recent innovations from the systems theory literature. In particular we deene codes as behaviors of a set of compact support time trajectories over a vector space. We also consider several diierent representations of codes, in...

Motivated by the increasing interest in powerful short channel codes for low-latency ultra-reliable communications, we analyze the performance of tail-biting convolutional codes with different memories, block lengths and code rates over the additive white Gaussian noise channel. The analysis is carried out both through Monte Carlo simulations and by upper bounding the error probability via Polt...

This chapter introduces a widely used class of codes, called convolutional codes, which are used in a variety of systems including today’s popular wireless standards (such as 802.11) and in satellite communications. They are also used as a building block in more powerful modern codes, such as turbo codes, which are used in wide-area cellular wireless network standards such as 3G, LTE, and 4G. C...

Braided convolutional codes (BCCs) form a class of iteratively decodable convolutional codes that are constructed from component convolutional codes. In braided code division multiple access (BCDMA), these very efficient error correcting codes are combined with a multiple access method and inherent interleaving for channel diversity exploitation into one single scheme. In this paper, we describ...

A rate R = 5/20 hypergraph-based woven convolutional code with overall constraint length 67 and constituent convolutional codes is presented. It is based on a 3-partite, 3uniform, 4-regular hypergraph and contains rate R = 3/4 constituent convolutional codes with overall constraint length 5. Although the code construction is based on low-complexity codes, the free distance of this construction,...

In this paper we use some classical ideas from linear systems theory to analyse convolutional codes. In particular, we exploit input-state-output representations of periodic linear systems to study periodically time-varying convolutional codes. In this preliminary work we focus on the column distance of these codes and derive explicit necessary and sufficient conditions for an (n, 2, 1) periodi...

A novel trellis design technique for both block and convolutional codes based on the Shannon product of component block codes is introduced. Using the proposed technique, structured trellises for block and convolutional codes have been designed. It is shown that the designed trellises are minimal and allow reduced complexity Viterbi decoding. Zndex Terms-Linear codes, trellis structure, product...

This chapter introduces a widely used class of codes, called convolutional codes, which are used in a variety of systems including today’s popular wireless standards (such as 802.11) and in satellite communications. They are also used as a building block in more powerful modern codes, such as turbo codes, which are used in wide-area cellular wireless network standards such as 3G, LTE, and 4G. C...

A class of geometrically structured quasi-cyclic low-density paritycheck codes with a cylinder structure graph and girth 12 is considered. The parity-check matrix of such a code consists of blocks of zeros and circulant permutation matrices. A class of convolutional codes is assigned to these codes. The convolutional form generator matrix of these codes is obtained by elementary row and column ...