On the Second Separating Redundancy of LDPC Codes from Finite Planes

Haiyang LIU  Yan LI  Lianrong MA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E101-A   No.3   pp.617-622
Publication Date: 2018/03/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E101.A.617
Type of Manuscript: LETTER
Category: Coding Theory
separating redundancy,  separating matrix,  low-density parity-check (LDPC) codes,  finite plane,  

Full Text: PDF>>
Buy this Article

The separating redundancy is an important concept in the analysis of the error-and-erasure decoding of a linear block code using a parity-check matrix of the code. In this letter, we derive new constructive upper bounds on the second separating redundancies of low-density parity-check (LDPC) codes constructed from projective and Euclidean planes over the field Fq with q even.