… of L circulant permutation matrices of size p 2 p … permutation matrix is any square matrix
with constant row and colum weight of one; a circulant permutation matrix is a permutation matrix …

… of codes defined by parity-check matrices composed of blocks of permutation matrices, is …
that, if all the permutation matrices that constitute the parity-check matrix of a code commute …

… For two positive integers J, L, J < L, let B be a binary matrix with row and … base matrix B and
circulant permutation matrix (CPM) of size m, we mean the code with the parity-check matrix …

… Abstract—An algorithm for generating parity-check matrices of regular low-density paritycheck
codes based on permutation matrices and Steiner triple systems S(v, 3, 2), v = 2m − 1, is …

… to describe the quasi-random matrix pattern. We create a parity check matrix composed of two
sub-matrices, H = [Hp… For example, using 6 permutation matrices we can construct a rate 2 …

… nary qm 2 q2 parity check matrices for binary array codes. For both parity check matrices, we
determine … For simplicity, in the rest of the paper we work with circulant permutation matrix …

… parity-check (LDPC) codes is presented. This construction is based on permutation matrices
… In this paper we introduce a new method based on permutation matrices which come from a …

… of random permutation matrices and all zeros by allzero matrices to form a parity-check matrix
of … To construct unsystematic SPCM (LDPC) codes, the steps related to the parity bits and …

… matrices and affine permutation matrices by ‘0’ and ‘1’, respectively, from the parity-check
matrix … parity check codes from circulant permutation matrices,” IEEE Trans. Inform. Theory, vol. …

… matrix is usually easier than access to scattered digits, it is natural to require that each parity
check … , of weights ~i and ~2, are identical (under permutation) in pairs, no parallel decoding …