… permutation … paritycheck matrix. It results in a better performance over the noisy channels
while transmitting. In this paper, a kind of permutation is proposed and the parity-check matrix …

… group of permutations on the set {1,...,n}. A permutation matrix represents a permutation of
coordinates, so we can also say that they are permutation equivalent if there is a permutation …

… It is no coincidence that the rows of the parity-check matrix are permutations of each other …
the parity-check matrix contains but multiples of 2 and 3. That implies that the one parity-check …

… The present paper introduces Low Rank Parity Check codes and is an extended version
of [21] originally presented at WCC 2013, with important new contributions. We propose an …

… The improved RRD (mRRD) combines several BP decoders in parallel, such that each
decoder utilises the same parity-check matrix but different random permutations. In this way, the …

… -density-parity-check codes, exempt of cycle of length 4, based on a circulant permutation
matrix, … structure is applied to guarantee that parity check bits can be recursively computed with …

… In this paper we consider binary quasi-cyclic (QC) LDPC codes, with parity-check matrices
which are m × n arrays of circulant permutation matrices (CPMs) of size t × t. These are the …

… for cyclic codes to arbitrary block codes with a known permutation group. In [9], the RRD …
same parity-check matrix, but with random permutations selected from the permutation group of …

… permutation matrix BN and the n-th Kronecker product of the polarizing matrix G = [1 0 …
Instead of using only CRC to detect wrongly decoded non-frozen bits, we consider a parity check (…

… The parity check matrix (PCM) of a QC-LDPC code consists of an array of circulants. Each
circulant is a square matrix … of circulant permutation matrices (CPMs) or zero matrices, where a …