A code block segmentation method, comprising: determining, by a base station, whether to use the maximum length of a first predetermined information bit, Kmax1, for code block segmentation or to use the maximum length of a second predetermined information bit, Kmax2, for code block segmentation in accordance with a type of a base graph; if it is determined to use the maximum length of the first predetermined information bit for code block segmentation, the base station segmenting a transport block into one or more segments by taking the maximum length of the first predetermined information bit as an upper limit; if it is determined to use the maximum length of the second predetermined information bit for code block segmentation, segmenting, by the base station, the transport block into one or more segments by taking the maximum length of the second predetermined information bit as the upper limit, wherein the maximum length of the first predetermined information bit is greater than the maximum length of the second predetermined information bit, wherein determining whether to use the maximum length of a first predetermined information bit, Kmax1, for code block segmentation or to use the maximum length of a second predetermined information bit, Kmax2, for code block segmentation comprises: determining, by the base station, the type of the base graph; if the type of the base graph is a first base graph, determining, by the base station, to use the maximum length of the first predetermined information bit for code block segmentation; if the type of the base graph is a second base graph, determining, by the base station, to use the maximum length of the second predetermined information bit for code block segmentation, wherein the lowest code rate of the first base graph is greater than the lowest code rate of the second base graph. determining, by a base station, whether to use the maximum length of a first predetermined information bit, Kmax1, for code block segmentation or to use the maximum length of a second predetermined information bit, Kmax2, for code block segmentation in accordance with a type of a base graph; if it is determined to use the maximum length of the first predetermined information bit for code block segmentation, the base station segmenting a transport block into one or more segments by taking the maximum length of the first predetermined information bit as an upper limit; if it is determined to use the maximum length of the second predetermined information bit for code block segmentation, segmenting, by the base station, the transport block into one or more segments by taking the maximum length of the second predetermined information bit as the upper limit, wherein the maximum length of the first predetermined information bit is greater than the maximum length of the second predetermined information bit, wherein determining whether to use the maximum length of a first predetermined information bit, Kmax1, for code block segmentation or to use the maximum length of a second predetermined information bit, Kmax2, for code block segmentation comprises: determining, by the base station, the type of the base graph; if the type of the base graph is a first base graph, determining, by the base station, to use the maximum length of the first predetermined information bit for code block segmentation; if the type of the base graph is a second base graph, determining, by the base station, to use the maximum length of the second predetermined information bit for code block segmentation, wherein the lowest code rate of the first base graph is greater than the lowest code rate of the second base graph. determining, by the base station, the type of the base graph; if the type of the base graph is a first base graph, determining, by the base station, to use the maximum length of the first predetermined information bit for code block segmentation; if the type of the base graph is a second base graph, determining, by the base station, to use the maximum length of the second predetermined information bit for code block segmentation, wherein the lowest code rate of the first base graph is greater than the lowest code rate of the second base graph.