In this paper we obtain at least 61 new singly even (Type I) binary [72,36,12] self-dual codes as a quasi-cyclic codes with m=2 (tailbitting convolutional codes) and at least 13 new doubly even (Type II) binary [72,36,12] self-dual codes by replacing the first row in each circulant in a double circulant code by "all ones" and "all zeros" vectors respectively. Keywords—convolutional encoding, qu...

The generalized Singleton bound and MDS-convolutional codes are reviewed. For each n, k and 6 an elementary construction of rate k / n MDS convolutional codes of degree 6 is given.

The generalized Singleton bound and MDS-convolutional codes are reviewed. For each n, k and 6 an elementary construction of rate k / n MDS convolutional codes of degree 6 is given.

QUAL COMM Israel. rror correction codes come in two flavors: block codes and convolutional codes. The most popular method of combining modulation and coding has been termed trellis coded modulation [ l ] (or more simply trellis codes). Pragmatic trellis codes were introduced in a previous IEEE Communications Magazine article [2] whereby the encoders and decoders for trellis codes were obtained ...

This paper presents the performance evaluation and comparison of various concatenated error correcting codes using Binary Phase Shift Keying (BPSK) modulation scheme. Three concatenated error correcting code pair i.e. Convolutional-Hamming, Convolutional-Cyclic, Convolutional-Bose, Chaudhuri Hocquenghem is designed and the BER performance was measured for an Additive White Gaussian Noise (AWGN)...

It is conjectured that quantum computers are able to solve certain problems more quickly than any deterministic or probabilistic computer. For instance, Shor’s algorithm is able to factor large integers in polynomial time on a quantum computer. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, it is a formidable task to build a quantum computer, since...

In our previous work, we have proposed a hybrid typeII Automatic Repeat reQuest (ARQ) scheme (Scheme 5) based on the Rate Compatible Punctured Convolutional (RCPC) codes which performs significantly better than all the other ARQ schemes in all the channel conditions. In this work, we study the performance of Scheme 5 based on High Rate Optimized RCPC (HRO-RCPC) codes combined with simple repeti...

Classic convolutional codes are defined as the convolution of a message and a transfer function over Z. In this paper, we study convolutional codes over the infinite dihedral group D∞. The goal of this study is to design convolutional codes with good and interesting properties and intended to be more resistant to code recognition. Convolution of two functions on D∞ corresponds to the product of...

In this paper we study adaptive power allocation (PA) policies for improving the performance of convolutional and turbo codes on fading channels. The transmitter has an average power constraint. The fading process can he continuous (e.g. Rayleigh distribution). Perfect channel state information at the transmitter (CSIT) and the receiver (CSIR) are assumed. For convolutional codes, we consider b...

In this paper we demonstrate that among all subspaces of GF(q) ! convolutional codes are best suited for error control purposes. To this end we regard several deening properties of convolutional codes and study the classes of subspaces deened by each of those properties alone. It turns out that these superclasses of the class of convolutional codes either achieve no better distance to rate rati...