Computer Science – Information Theory
Scientific paper
2010-10-10
Computer Science
Information Theory
submitted to IEEE Trans. on Communications
Scientific paper
This paper addresses the issue of design of low-rate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which needs to be satisfied when the linear minimum distance is to be ensured. The condition is formulated in terms of degree-1 and degree-2 variable nodes and of low-weight codewords of the underlying code, and it generalizies results known for turbo codes [8] and LDPC codes. Then, we present a new ensemble of low-rate codes, which itself is a subclass of TLDPC codes [4], [5], and which is designed under this necessary condition. The asymptotic analysis of the ensemble shows that its iterative threshold is situated close to the Shannon limit. In addition to the linear minimum distance property, it has a simple structure and enjoys a low decoding complexity and a fast convergence.
Andriyanova Iryna
Tillich Jean-Pierre
No associations
LandOfFree
On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-88098