LDPC code designs based on √I matrices
Shayan Garani Srinivasa · 2014
LDPC codes can be constructed by tiling permutation matrices that belong to the square root of identity type and similar algebraic structures. We investigate into the properties of such codes. We also present code structures that are amenable for efficient encoding.