Construction of LDPC convolutional codes via difference triangle sets

08/31/2020
by   Gianira N. Alfarano, et al.
0

In this paper, a construction of (n,k,δ) LDPC convolutional codes over arbitrary finite fields, which generalizes the work of Robinson and Bernstein and the later work of Tong is provided. The sets of integers forming a (k,w)-(weak) difference triangle set are used as supports of some columns of the sliding parity-check matrix of an (n,k,δ) convolutional code, where n∈ℕ, n>k. The parameters of the convolutional code are related to the parameters of the underlying difference triangle set. In particular, a relation between the free distance of the code and w is established as well as a relation between the degree of the code and the scope of the difference triangle set. Moreover, we show that some conditions on the weak difference triangle set ensure that the Tanner graph associated to the sliding parity-check matrix of the convolutional code is free from 2ℓ-cycles not satisfying the full rank condition over any finite field. Finally, we relax these conditions and provide a lower bound on the field size, depending on the parity of ℓ, that is sufficient to still avoid 2ℓ-cycles. This is important for improving the performance of a code and avoiding the presence of low-weight codewords and absorbing sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/22/2020

Construction of Rate (n-1)/n Non-Binary LDPC Convolutional Codes via Difference Triangle Sets

This paper provides a construction of non-binary LDPC convolutional code...
research
05/07/2021

Necessary and Sufficient Girth Conditions for Tanner Graphs of Quasi-Cyclic LDPC Codes

This paper revisits the connection between the girth of a protograph-bas...
research
03/21/2018

Efficient Search of QC-LDPC Codes with Girths 6 and 8 and Free of Elementary Trapping Sets with Small Size

One of the phenomena that influences significantly the performance of lo...
research
12/10/2021

A Class of (n, k, r, t) IS-LRCs Via Parity Check Matrix

A code is called (n, k, r, t) information symbol locally repairable code...
research
08/03/2021

A Unifying Framework to Construct QC-LDPC Tanner Graphs of Desired Girth

This paper presents a unifying framework to construct low-density parity...
research
01/05/2021

A New Formula for the Minimum Distance of an Expander Code

An expander code is a binary linear code whose parity-check matrix is th...
research
02/15/2019

Effective distribution of codewords for Low Density Parity Check Cycle codes in the presence of disorder

We review the zeta-function representation of codewords allowed by a par...

Please sign up or login with your details

Forgot password? Click here to reset