Abstract: Provided is a system and method for determining a generalized Low-Density Parity-Check (LDPC) code for forward error correction channel coding that has a repeat-accumulate code structure.

Abstract: Provided is an encoder, a decoder, a computer-readable medium and methods of forward error correction channel encoding/decoding within a HARQ scheme, based on a generalized quasi-cyclic low-density parity-check code comprising a Cordaro-Wagner component code.

Abstract: Devices and methods are disclosed for generating on the basis of a first protograph matrix P1 of size m×n, wherein the first protograph matrix P1 defines a first code H1, a second protograph matrix P2 of size (m+d)×(n+d), wherein the second protograph matrix P2 defines a second code H2. The device comprises a processor configured to: generate an auxiliary protograph matrix P? of size (m+d1)×(n+d1) on the basis of the first protograph matrix P1 using row splitting; generate d2 random integer numbers, wherein d2=d?d1; generate a binary matrix M of size d2×(n?m), wherein rows of the binary matrix M are generated on the basis of the d2 random integer numbers; generate a matrix M? by lifting the binary matrix M; Other operation steps are also included.

Abstract: A method for quasi-cyclic low-density parity-check (QC-LDPC) encoding and decoding of a data packet by a lifted matrix is provided, the method comprising: lifting the QC-LDPC code for maximal code length Nmax and maximal circulant size Zupper of the base matrix; generating a plurality of optimal values ri for a plurality of circulants Z1, Z2, . . . , Zupper based on the QC-LDPC code lifted for maximal length Nmax, 0?ri?Zupper?1; saving the generated plurality of optimal values ri corresponding to the plurality of circulants Z1, Z2, . . . , Zupper and a matrix for the QC-LDPC code lifted for maximal length Nmax in the memory; receiving a current circulant Zcurrent from the plurality of circulants Z1, Z2, . . . , Zupper; selecting a current optimal value rcurrent from the plurality of optimal values ri stored in the memory corresponding to the current circulant Zcurrent; and lifting the base matrix based on the current optimal value rcurrent.

Abstract: Provided is an encoder, a decoder, a computer-readable medium and methods of forward error correction channel encoding/decoding within a HARQ scheme, based on a generalized quasi-cyclic low-density parity-check code comprising a Cordaro-Wagner component code.

Abstract: Provided is a system and method for determining a generalized LDPC code for forward error correction channel coding that has a repeat-accumulate code structure.

Abstract: Devices and methods are disclosed for generating on the basis of a first protograph matrix P1 of size m×n, wherein the first protograph matrix P1 defines a first code H1, a second protograph matrix P2 of size (m+d)×(n+d), wherein the second protograph matrix P2 defines a second code H2. The device comprises a processor configured to: generate an auxiliary protograph matrix P? of size (m+d1)×(n+d1) on the basis of the first protograph matrix P using row splitting; generate d2 random integer numbers, wherein d2=d?d1; generate a binary matrix M of size d2×(n?m), wherein rows of the binary matrix M are generated on the basis of the d2 random integer numbers; generate a matrix M? by lifting the binary matrix M; Other operation steps are also included.

Abstract: A method for quasi-cyclic low-density parity-check (QC-LDPC) encoding and decoding of a data packet by a lifted matrix is provided, the method comprising: lifting the QC-LDPC code for maximal code length Nmax and maximal circulant size Zupper of the base matrix; generating a plurality of optimal values ri for a plurality of circulants Z1, Z2, . . . , Zupper based on the QC-LDPC code lifted for maximal length Nmax, 0?ri?Zupper?1; saving the generated plurality of optimal values ri corresponding to the plurality of circulants Z1, Z2, . . . , Zupper and a matrix for the QC-LDPC code lifted for maximal length Nmax in the memory; receiving a current circulant Zcurrent from the plurality of circulants Z1, Z2, . . . , Zupper; selecting a current optimal value rcurrent from the plurality of optimal values ri stored in the memory corresponding to the current circulant Zcurrent; and lifting the base matrix based on the current optimal value rcurrent.