The paper presents analysis and simulation for the convolutional coded DH-PIM using 1⁄2 convolutional code with the constraint length of 3. Decoding is implemented using the Viterbi algorithm. The proposed scheme is simulated for a constraint length of 7 and the results are compared with a number of different modulation techniques. DH-PIM with convolutional coding requires about 4-5 dB lower SN...

In this paper, we construct new families of convolutional codes. Such codes are obtained by means of algebraic geometry codes. Additionally, more families of convolutional codes are constructed by means of puncturing, extending, expanding and by the direct product code construction applied to algebraic geometry codes. The parameters of the new convolutional codes are better than or comparable t...

In this paper we address the problem of decoding 2D convolutional codes over the erasure channel. In particular, we present a procedure to recover bursts of erasures that are distributed in a diagonal line. To this end we introduce the notion of balls around a burst of erasures which can be considered an analogue of the notion of sliding window in the context of 1D convolutional codes. The main...

Constructions of woven graph codes based on constituent convolutional codes are studied, and examples of woven convolutional graph codes are presented. Existence of codes satisfying the Costello lower bound on the free distance within a random ensemble of woven graph codes based on s-partite, s-uniform hypergraphs is shown, where s depends only on the code rate. Simulation results for Viterbi d...

Unlike the usual turbo codes, “unifilar turbo codes” are based on only one underlying trellis code. If terminated (i.e., as block codes), they perform as well as (ordinary) turbo codes; if not termina ted (i.e., as convolutional codes), they are attractive for continuous transmission under tight delay

In this thesis, we present modern and efficient channel coding techniques for the protection of user data with heterogeneous error sensitivities. Especially multimedia data being transmitted through communication networks often consist of unequally important parts, such as header information, essential payload, and additional data for increased quality. Protecting all data equally makes the tra...

Resumo Maximum Distance Separable (MDS) convolutional codes are characterized through the property that the free distance meets the generalized Singleton bound. The existence of free MDS convolutional codes over Zpr was recently discovered in [26] via the Hensel lift of a cyclic code. In this paper we further investigate this important class of convolutional codes over Zpr from a new perspectiv...

Using a new parity-check matrix, a class of convolutional codes with a designed free distance is introduced. This new class of codes has many characteristics of BCH block codes, therefore, we call these codes BCH convolutional codes.

In this paper two-dimensional convolutional codes with finite support are considered, i.e., convolutional codes whose codewords have compact support indexed in N and take values in F, where F is a finite field. The main goal of this work is to analyze the (free) distance properties of this type of codes of rate 1/n and degree δ. We first establish an upper bound on the maximum possible distance...