On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes

Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00671660
Contributor : Iryna Andriyanova <>
Submitted on : Saturday, February 18, 2012 - 9:35:22 AM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM

Links full text

Identifiers

  • HAL Id : hal-00671660, version 1
  • ARXIV : 1010.1911

Collections

Citation

Iryna Andriyanova, Jean-Pierre Tillich. On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes. 2010. ⟨hal-00671660⟩

Share

Metrics

Record views

322