The expression for the minimum Hamming weight of the output of a constituent convolutional encoder, when its input is a weight-2 sequence is revisited. The new expression particularly facilitates the calculation of the effective free distance of recently proposed schemes, namely non-systematic turbo codes and pseudo-randomly punctured turbo codes
A large number of papers have been published attempting to give some analytical basis for the perfor...
Several parallel concatenated coding schemes (turbo codes) based on multimemory (MM) convolutional c...
In this article we apply transfer function bounding techniques to obtain upper bounds on the bit-err...
The expression for the minimum Hamming weight of the output of a constituent convolutional encoder, ...
The performance of turbo codes at the error floor region is largely determined by the effective free...
The performance of Turbo codes can be improved by choosing the best constituent encoder. Previous li...
In this article, we design new turbo codes that can achieve near-Shannon-limit performance. The desi...
Convolutional codes form an important class of codes that have memory. One natural way to study thes...
A simple algorithm for the weight calculation of turbo codes with convolutional interleavers is pres...
This article takes a preliminary look at the weight distributions achievable for turbo codes using r...
The authors define and study the effective free distance of a turbo code. If a turbo code is constru...
Abstract- The performance of Turbo codes is addressed by examining the code's distance spectrum...
4siIn this paper, we introduce the concept of nonsystematic turbo codes and compare them with classi...
Abstract—Minimum distances and maximum likelihood error probabilities of serial turbo codes with uni...
The performance of Turbo codes is addressed by examining the code's distance spectrum. The `err...
A large number of papers have been published attempting to give some analytical basis for the perfor...
Several parallel concatenated coding schemes (turbo codes) based on multimemory (MM) convolutional c...
In this article we apply transfer function bounding techniques to obtain upper bounds on the bit-err...
The expression for the minimum Hamming weight of the output of a constituent convolutional encoder, ...
The performance of turbo codes at the error floor region is largely determined by the effective free...
The performance of Turbo codes can be improved by choosing the best constituent encoder. Previous li...
In this article, we design new turbo codes that can achieve near-Shannon-limit performance. The desi...
Convolutional codes form an important class of codes that have memory. One natural way to study thes...
A simple algorithm for the weight calculation of turbo codes with convolutional interleavers is pres...
This article takes a preliminary look at the weight distributions achievable for turbo codes using r...
The authors define and study the effective free distance of a turbo code. If a turbo code is constru...
Abstract- The performance of Turbo codes is addressed by examining the code's distance spectrum...
4siIn this paper, we introduce the concept of nonsystematic turbo codes and compare them with classi...
Abstract—Minimum distances and maximum likelihood error probabilities of serial turbo codes with uni...
The performance of Turbo codes is addressed by examining the code's distance spectrum. The `err...
A large number of papers have been published attempting to give some analytical basis for the perfor...
Several parallel concatenated coding schemes (turbo codes) based on multimemory (MM) convolutional c...
In this article we apply transfer function bounding techniques to obtain upper bounds on the bit-err...