Explore chapters and articles related to this topic
LDPC Codes Based on Rational Functions
Published in IETE Journal of Research, 2021
Mohammad Gholami, Akram Nassaj
Define . Clearly, is a non-abelian group with the following product operation:
Now, for a given exponent matrix E of a RLDPC code with the elements belong to , by an extension of E, we mean the exponent matrix derived by multiplying the rows or columns of E by some elements of . By Lemma 3.1, it can be seen easily that the RLDPC code with the exponent matrix E is equivalent with an APM-LDPC code if and only if there is an extension of E, say , such that all of the elements of belong to the set . In continue, type-I and type-II RLDPC codes are precedented which are and are not equivalent with APM-LDPC codes,respectively.