A communication method comprising: obtaining a to-be-segmented first bit sequence, wherein a quantity of bits in the first bit sequence is B, and a quantity of bits that can be carried by a physical resource corresponding to the first bit sequence is N 1; determining, based on N 1 and a parameter L, a quantity C of bit sequences obtained by segmenting the first bit sequence, wherein a value of L is equal to (B+B 1)/R min, K max, R min, K max is a minimum code rate corresponding to an available maximum code block length K max, and B 1 is an integer greater than or equal to 0; and segmenting the first bit sequence into C segmented bit sequences, characterized in that the determining C based on N 1 and L comprises one of the following: - when L<N 1, C = ⌈ N 1 / N max ⌉, wherein ┌ ┐ represents rounding up, and a value of N max is equal to a value of K max / R min, K max, or - when L<N 1, C tmp = ⌈ N 1 / N max ⌉, wherein ┌ ┐ represents rounding up, and a value of N max is equal to a value of K max/ R min, K max; and when ⌈ N 1 / C tmp ⌉ < N threshold, C= C tmp - Δ, wherein N threshold is a preset threshold, Δ is an offset, Δ is a positive integer which satisfies the condition ⌈ B + B 1 / C tmp − Δ ⌉ ≤ K max, or - when L<N 1, C = ⌈ N 1 ′ / N max ⌉, wherein ┌ ┐ represents rounding up, a value of N max is equal to a value of K max / R min, K max, N 1 '=min ( N 1, (B+B 1)/R min), and R min is a minimum available code rate used for encoding of the segmented first bit sequence, or - when L<N 1, C tmp = ⌈ N 1 ′ / N max ⌉, wherein ┌ ┐ represents rounding up, a value of N max is equal to a value of K max / R min, K max, N 1 ' =min ( N 1, (B+B 1)/R min), and R min is a minimum available code rate used for encoding the segmented first bit sequence; and when ⌈ N 1 ′ / C tmp ⌉ < N threshold, C =C tmp -Δ wherein N threshold is a preset threshold, Δ is an offset, A is a positive integer which satisfies the condition ⌈ B + B 1 / C tmp − Δ ⌉ ≤ K max. obtaining a to-be-segmented first bit sequence, wherein a quantity of bits in the first bit sequence is B, and a quantity of bits that can be carried by a physical resource corresponding to the first bit sequence is N 1; determining, based on N 1 and a parameter L, a quantity C of bit sequences obtained by segmenting the first bit sequence, wherein a value of L is equal to (B+B 1)/R min, K max, R min, K max is a minimum code rate corresponding to an available maximum code block length K max, and B 1 is an integer greater than or equal to 0; and segmenting the first bit sequence into C segmented bit sequences, characterized in that the determining C based on N 1 and L comprises one of the following: - when L<N 1, C = ⌈ N 1 / N max ⌉, wherein ┌ ┐ represents rounding up, and a value of N max is equal to a value of K max / R min, K max, or - when L<N 1, C tmp = ⌈ N 1 / N max ⌉, wherein ┌ ┐ represents rounding up, and a value of N max is equal to a value of K max/ R min, K max; and - when L<N 1, C = ⌈ N 1 / N max ⌉, wherein ┌ ┐ represents rounding up, and a value of N max is equal to a value of K max / R min, K max, or - when L<N 1, C tmp = ⌈ N 1 / N max ⌉, wherein ┌ ┐ represents rounding up, and a value of N max is equal to a value of K max/ R min, K max; and when ⌈ N 1 / C tmp ⌉ < N threshold, C= C tmp - Δ, wherein N threshold is a preset threshold, Δ is an offset, Δ is a positive integer which satisfies the condition ⌈ B + B 1 / C tmp − Δ ⌉ ≤ K max, or - when L<N 1, C = ⌈ N 1 ′ / N max ⌉, wherein ┌ ┐ represents rounding up, a value of N max is equal to a value of K max / R min, K max, N 1 '=min ( N 1, (B+B 1)/R min), and R min is a minimum available code rate used for encoding of the segmented first bit sequence, or - when L<N 1, C tmp = ⌈ N 1 ′ / N max ⌉, wherein ┌ ┐ represents rounding up, a value of N max is equal to a value of K max / R min, K max, N 1 ' =min ( N 1, (B+B 1)/R min), and R min is a minimum available code rate used for encoding the segmented first bit sequence; and - when L<N 1, C = ⌈ N 1 ′ / N max ⌉, wherein ┌ ┐ represents rounding up, a value of N max is equal to a value of K max / R min, K max, N 1 '=min ( N 1, (B+B 1)/R min), and R min is a minimum available code rate used for encoding of the segmented first bit sequence, or - when L<N 1, C tmp = ⌈ N 1 ′ / N max ⌉, wherein ┌ ┐ represents rounding up, a value of N max is equal to a value of K max / R min, K max, N 1 ' =min ( N 1, (B+B 1)/R min), and R min is a minimum available code rate used for encoding the segmented first bit sequence; and when ⌈ N 1 ′ / C tmp ⌉ < N threshold, C =C tmp -Δ wherein N threshold is a preset threshold, Δ is an offset, A is a positive integer which satisfies the condition ⌈ B + B 1 / C tmp − Δ ⌉ ≤ K max.