A permutor (interleaver) design method was proposed to show the existence of turbo codes with minimum distance growing logarithmically with the permutor length. It was found that the minimum distance of a turbo code depended on the structure of the permutor or on its life cycle structures. It was demonstrated that the method could be used for the construction of turbo codes with practical blocklengths
New digital communication applications, such as multimedia, require very powerful error correcting c...
The performance and design of a deterministic interleaver for short frame turbo codes is considered ...
The performance of a turbo code is dependent on two properties of the code: its distance spectrum an...
We derive new upper bounds on the minimum distance, which turbo codes can maximally attain with the ...
We consider the following problems related to the construction and analysis of turbo-codes: asymptot...
Proposed is a method based on the Dijkstra's algorithm and an estimation of the distance to search f...
Abstract — This letter presents an efficient and accurate dis-tance measurement method for tail-biti...
A new algorithm for computing the free distance of turbo codes is applied to the CCSDS and the UMTS ...
The authors define and study the effective free distance of a turbo code. If a turbo code is constru...
Turbo codes offer extraordinary performance, especially at low signal to noise ratio, due to a low m...
Abstract—Minimum distances and maximum likelihood error probabilities of serial turbo codes with uni...
This work considers the design of short parallel turbo codes (PTC) with block lengths in the order o...
The performance of Turbo codes can be improved by choosing the best constituent encoder. Previous li...
In this paper, we study the problem of joint permutor analysis and design for J-dimensional multiple...
In this paper, we study the problem of joint permutor analysis and design for J-dimensional multiple...
New digital communication applications, such as multimedia, require very powerful error correcting c...
The performance and design of a deterministic interleaver for short frame turbo codes is considered ...
The performance of a turbo code is dependent on two properties of the code: its distance spectrum an...
We derive new upper bounds on the minimum distance, which turbo codes can maximally attain with the ...
We consider the following problems related to the construction and analysis of turbo-codes: asymptot...
Proposed is a method based on the Dijkstra's algorithm and an estimation of the distance to search f...
Abstract — This letter presents an efficient and accurate dis-tance measurement method for tail-biti...
A new algorithm for computing the free distance of turbo codes is applied to the CCSDS and the UMTS ...
The authors define and study the effective free distance of a turbo code. If a turbo code is constru...
Turbo codes offer extraordinary performance, especially at low signal to noise ratio, due to a low m...
Abstract—Minimum distances and maximum likelihood error probabilities of serial turbo codes with uni...
This work considers the design of short parallel turbo codes (PTC) with block lengths in the order o...
The performance of Turbo codes can be improved by choosing the best constituent encoder. Previous li...
In this paper, we study the problem of joint permutor analysis and design for J-dimensional multiple...
In this paper, we study the problem of joint permutor analysis and design for J-dimensional multiple...
New digital communication applications, such as multimedia, require very powerful error correcting c...
The performance and design of a deterministic interleaver for short frame turbo codes is considered ...
The performance of a turbo code is dependent on two properties of the code: its distance spectrum an...