This work considers the design of short parallel turbo codes (PTC) with block lengths in the order of (a few) hundred code bits. In particular we aim at designing codes with large minimum distance. To this end a structured approach is presented to find suitable component code configurations, as well as interleavers. As a result the proposed turbo codes possess low error floors and outperform competing binary low-density parity-check (LDPC) codes by approximately 0.9dB and state-of-the-art binary turbo codes by 0.4dB at a code word error rate (CER) of about 10^{-7}. The loss w.r.t to the random coding bound (RCB) is only about 0.8dB
The performance of Turbo codes can be improved by choosing the best constituent encoder. Previous li...
Minimum distances and maximum likelihood error probabilities of serial turbo codes with uniform inte...
Turbo codes can deliver performance that is very close to the Shannon limit. This report investigate...
This work considers the design of short parallel turbo codes (PTC) with block lengths in the order o...
This paper presents a comparative performance and complexity study between low-density parity-check ...
A permutor (interleaver) design method was proposed to show the existence of turbo codes with minimu...
International audienceThis paper describes the ways to construct turbo codes using a parallel concat...
In this correspondence, we present the results of the optimization applied to the design of interlea...
Turbo codes are a parallel concatenation of two or more convolutional codes, separated by interleave...
Abstract—This correspondence concerns the performance analysis of turbo-single-parity-check (SPC) co...
Turbo codes offer extraordinary performance, especially at low signal to noise ratio, due to a low m...
none5siTwo classes of turbo codes constructed on high-order finite fields are introduced. The codes ...
This thesis analyzes the design of low complexity capacity approaching codes suitable for data trans...
Abstract — This paper presents a new turbo coding scheme for high data rate applications. It uses a ...
Proposed is a method based on the Dijkstra's algorithm and an estimation of the distance to search f...
The performance of Turbo codes can be improved by choosing the best constituent encoder. Previous li...
Minimum distances and maximum likelihood error probabilities of serial turbo codes with uniform inte...
Turbo codes can deliver performance that is very close to the Shannon limit. This report investigate...
This work considers the design of short parallel turbo codes (PTC) with block lengths in the order o...
This paper presents a comparative performance and complexity study between low-density parity-check ...
A permutor (interleaver) design method was proposed to show the existence of turbo codes with minimu...
International audienceThis paper describes the ways to construct turbo codes using a parallel concat...
In this correspondence, we present the results of the optimization applied to the design of interlea...
Turbo codes are a parallel concatenation of two or more convolutional codes, separated by interleave...
Abstract—This correspondence concerns the performance analysis of turbo-single-parity-check (SPC) co...
Turbo codes offer extraordinary performance, especially at low signal to noise ratio, due to a low m...
none5siTwo classes of turbo codes constructed on high-order finite fields are introduced. The codes ...
This thesis analyzes the design of low complexity capacity approaching codes suitable for data trans...
Abstract — This paper presents a new turbo coding scheme for high data rate applications. It uses a ...
Proposed is a method based on the Dijkstra's algorithm and an estimation of the distance to search f...
The performance of Turbo codes can be improved by choosing the best constituent encoder. Previous li...
Minimum distances and maximum likelihood error probabilities of serial turbo codes with uniform inte...
Turbo codes can deliver performance that is very close to the Shannon limit. This report investigate...