A channel coding method, applied to low-density parity-check, LDPC, coding, comprising: obtaining an information code vector M of an LDPC code, wherein the information code vector M comprises information that needs to be transmitted; generating a check matrix of the LDPC code, wherein the check matrix is H=[H a H b]; calculating P T according to a first formula P T = H b − 1 ⋅ H a ⋅ M T, the information code vector M, and the check matrix H, and generating a check code vector P of the LDPC code according to P T; and generating a codeword vector of the LDPC code according to a second formula C=[M P], the information code vector M, and the check code vector P, wherein C is the codeword vector, wherein H a = E a 11 E a 12 ⋯ E a 1 ⁢ k E a 21 E a 22 ⋯ E a 2 ⁢ k ⋮ ⋮ ⋱ ⋮ E a m 1 E a m 2 ⋯ E a mk m × k. H b = A 1 I 0 0 ⋯ 0 0 I I 0 ⋯ 0 ⋮ ⋱ ⋱ ⋱ ⋱ ⋮ 0 ⋯ 0 I I 0 0 0 ⋯ 0 I I A 2 0 ⋯ 0 0 I m × m, or H b = A 1 0 0 ⋯ 0 I A 2 I 0 ⋯ 0 0 0 I ⋱ ⋱ ⋮ ⋮ 0 0 ⋱ I 0 0 ⋮ ⋮ ⋱ I I 0 0 0 ⋯ 0 I I m × m, wherein m and n are positive integers, k=n-m, I is an l -order identity matrix, 0 is an l -order zero matrix, matrixes A 1 and A 2 are l -order submatrixes of the matrix H b, in a binary matrix operation, A 1 +A 2 =A, A is an invertible matrix, A 1, A 2 and A are circulant matrixes, E a ij is an l -order submatrix in the check matrix H, and E a ij is a circulant identity matrix that is obtained by performing circular right shift on the l -order identity matrix by a ij bits, wherein a ij ∈ {-1,0,1,2,···, l -1}, 1≤ i ≤ m,1≤ j≤k; wherein, in the matrix H b, A = A 1 + A 2 = E x, 1≤ x ≤ l -1, wherein E x is a circulant identity matrix that is obtained by performing circular right shift on the l -order identity matrix by x bits. obtaining an information code vector M of an LDPC code, wherein the information code vector M comprises information that needs to be transmitted; generating a check matrix of the LDPC code, wherein the check matrix is H=[H a H b]; calculating P T according to a first formula P T = H b − 1 ⋅ H a ⋅ M T, the information code vector M, and the check matrix H, and generating a check code vector P of the LDPC code according to P T; and generating a codeword vector of the LDPC code according to a second formula C=[M P], the information code vector M, and the check code vector P, wherein C is the codeword vector, wherein H a = E a 11 E a 12 ⋯ E a 1 ⁢ k E a 21 E a 22 ⋯ E a 2 ⁢ k ⋮ ⋮ ⋱ ⋮ E a m 1 E a m 2 ⋯ E a mk m × k. H b = A 1 I 0 0 ⋯ 0 0 I I 0 ⋯ 0 ⋮ ⋱ ⋱ ⋱ ⋱ ⋮ 0 ⋯ 0 I I 0 0 0 ⋯ 0 I I A 2 0 ⋯ 0 0 I m × m, or H b = A 1 0 0 ⋯ 0 I A 2 I 0 ⋯ 0 0 0 I ⋱ ⋱ ⋮ ⋮ 0 0 ⋱ I 0 0 ⋮ ⋮ ⋱ I I 0 0 0 ⋯ 0 I I m × m, wherein m and n are positive integers, k=n-m, I is an l -order identity matrix, 0 is an l -order zero matrix, matrixes A 1 and A 2 are l -order submatrixes of the matrix H b, in a binary matrix operation, A 1 +A 2 =A, A is an invertible matrix, A 1, A 2 and A are circulant matrixes, E a ij is an l -order submatrix in the check matrix H, and E a ij is a circulant identity matrix that is obtained by performing circular right shift on the l -order identity matrix by a ij bits, wherein a ij ∈ {-1,0,1,2,···, l -1}, 1≤ i ≤ m,1≤ j≤k; wherein, in the matrix H b, A = A 1 + A 2 = E x, 1≤ x ≤ l -1, wherein E x is a circulant identity matrix that is obtained by performing circular right shift on the l -order identity matrix by x bits.