In this paper we present a concrete algebraic construction of novel class convolutional codes. These codes are built upon generalized Vandermonde matrices and therefore can be seen as natural extension Reed-Solomon block to the context For reason call them weighted (WRS) We show that under some constraints on defining parameters these Maximum Distance Profile (MDP), which means they have maxima...

Many wireless communication systems such as IS-54, EDGE, WiMAX, and LTE have adopted turbo codes and tail-biting convolutional codes as the forward error correcting codes (FEC) scheme for data and overhead channels. However, some releases propose LDPC codes for error-corrections due to the relative complexity of turbo codes decoder implementations as well as the success of LDPC codes in achievi...

Ascetic convolutional codes contain fewer edge labels than other convolutional codes. This is advantageous in several practical situations. Selecting an ascetic code over a non-ascetic code carries no severe penalty, in terms of trade-off of minimum distance, code rate and complexity.

In this paper, we propose use of convolutional codes for file dispersal. The proposed method is comparable in complexity to the information Dispersal Algorithm proposed by M.Rabin and for particular choices of (non-binary) convolutional codes, is almost as efficient as that algorithm in terms of controlling expansion in the total storage. Further, our proposed dispersal method allows string

This paper describes construction of a convolutional interleaver as a block interleaver and discusses its application to turbo codes with equal and unequal error protection techniques. Based on simulations, different convolutional interleaver structures suitable for turbo codes with unequal error protection capability are suggested. Finally, based on conducted simulations the best method is sel...