A method of selecting a base graph of a low-density parity-check code, comprising: acquiring a data information length and a channel coding rate of to-be-encoded data; wherein the method further comprises: determining a target base graph selection strategy according to the data information length and an information length range of a base graph; and determining a target base graph for the to-be-encoded data according to the target base graph selection strategy and the channel coding rate, wherein determining the target base graph selection strategy according to the data information length and the information length range of the base graph, comprises: acquiring a first minimum information length Kmin1 and a first maximum information length Kmax1 of a first graph in base graphs; acquiring a second minimum information length Kmin2 and a second maximum information length Kmax2 of a second graph in the base graphs; characterized by: determining the target base graph selection strategy based on a size relation among the data information length K and the first minimum information length, the first maximum information length, the second minimum information length, and the second maximum information length, wherein Kmin2 < Kmin1 ≤ Kmax2 < Kmax1. determining a target base graph selection strategy according to the data information length and an information length range of a base graph; and determining a target base graph for the to-be-encoded data according to the target base graph selection strategy and the channel coding rate, wherein determining the target base graph selection strategy according to the data information length and the information length range of the base graph, comprises: acquiring a first minimum information length Kmin1 and a first maximum information length Kmax1 of a first graph in base graphs; acquiring a second minimum information length Kmin2 and a second maximum information length Kmax2 of a second graph in the base graphs; characterized by: determining the target base graph selection strategy based on a size relation among the data information length K and the first minimum information length, the first maximum information length, the second minimum information length, and the second maximum information length, wherein Kmin2 < Kmin1 ≤ Kmax2 < Kmax1. acquiring a first minimum information length Kmin1 and a first maximum information length Kmax1 of a first graph in base graphs; acquiring a second minimum information length Kmin2 and a second maximum information length Kmax2 of a second graph in the base graphs; characterized by: determining the target base graph selection strategy based on a size relation among the data information length K and the first minimum information length, the first maximum information length, the second minimum information length, and the second maximum information length, wherein Kmin2 < Kmin1 ≤ Kmax2 < Kmax1. determining the target base graph selection strategy based on a size relation among the data information length K and the first minimum information length, the first maximum information length, the second minimum information length, and the second maximum information length, wherein Kmin2 < Kmin1 ≤ Kmax2 < Kmax1.