Communication method, communication device, storage medium, and program product

Abstract

The embodiment of the invention provides a communication method, a communication device, a storage medium and a program product, relates to the technical field of communication, and can solve the technical problem of relatively complex channel coding in related technologies. The method is applied to a first node and comprises the following steps: receiving control information from a second node; based on the control information, determining a coding rate and / or repetition times; generating a first sequence based on an information bit sequence and the coding rate and / or the number of repetitions; and sending the first sequence to the second node.

Description

Technical Field

[0001] The present disclosure relates to the field of communication technologies, and in particular, to a communication method, a communication device, a storage medium, and a program product. Background Art

[0002] With the rapid development of technologies such as big data, cloud computing, and delay-sensitive networks, the number of user devices in wireless communication networks has increased explosively. The wireless communication network will carry diverse applications and massive amounts of data, which poses high requirements for data transmission rate, throughput, reliability, delay, etc. Currently, with the development of intelligent transportation, intelligent industrial control, intelligent logistics, etc., the communication requirements for ultra-low delay and ultra-high reliability are becoming increasingly strong, that is, some short packet data needs to be sent and successfully received within an extremely short time.

[0003] However, the current channel coding for short packets is relatively complex, and there is a problem of relatively high transmission delay. Summary of the Invention

[0004] Embodiments of the present disclosure provide a communication method, a communication device, a storage medium, and a program product, which can solve the technical problem of relatively complex channel coding in related technologies.

[0005] On the one hand, a communication method is provided, which is applied to a first node. The method includes:

[0006] Receiving control information from a second node;

[0007] Based on the control information, determining a coding code rate and / or a repetition number;

[0008] Generating a first sequence based on an information bit sequence, and the coding code rate and / or the repetition number;

[0009] Sending the first sequence to the second node.

[0010] On the other hand, a communication device is provided, including: a receiving module, a processing module, and a sending module.

[0011] The receiving module is configured to receive control information from a second node;

[0012] The processing module is configured to determine a coding code rate and / or a repetition number based on the control information;

[0013] The processing module is configured to generate a first sequence based on an information bit sequence, and the coding code rate and / or the repetition number;

[0014] The sending module is configured to send the first sequence to the second node.

[0015] In another aspect, a communication method is provided, which is applied to a second node. The method includes:

[0016] Sending control information to a first node, where the control information is used to determine a coding rate and / or a repetition number;

[0017] Receiving a first sequence sent by the first node;

[0018] Performing processing on the first sequence based on the coding rate and / or the repetition number to obtain an information bit sequence.

[0019] In another aspect, a communication device is provided, including: a sending module, a receiving module, and a processing module.

[0020] The sending module is configured to send control information to a first node, where the control information is used to determine a coding rate and / or a repetition number;

[0021] The receiving module is configured to receive a first sequence sent by the first node;

[0022] The processing module is configured to perform processing on the first sequence based on the coding rate and / or the repetition number to obtain an information bit sequence.

[0023] In another aspect, a communication device is provided, including: a memory and a processor; the memory and the processor are coupled; the memory is used to store a computer program; when the processor executes the computer program, the method described in any of the above embodiments is implemented.

[0024] In another aspect, a computer-readable storage medium is provided, on which computer program instructions are stored. When the computer program instructions are executed by a processor, the method described in any of the above embodiments is implemented.

[0025] In another aspect, a computer program product is provided, which includes computer program instructions. When the computer program instructions are executed by a processor, the method described in any of the above embodiments is implemented.

[0026] The embodiments of the present disclosure provide a communication method, which processes an information bit sequence through a coding rate and / or a repetition number, generates and sends a first sequence. Compared with the coding and sending process in the traditional technology, the complexity is lower, the delay is lower, and the capability requirement for the first node is lower. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] In order to more clearly illustrate the technical solutions in the present disclosure, the following will briefly introduce the drawings required to be used in some embodiments of the present disclosure. Obviously, the drawings in the following description are only the drawings of some embodiments of the present disclosure. For those of ordinary skill in the art, other drawings can also be obtained based on these drawings.

[0028] Figure 1 System architecture diagram of a communication system provided by the present disclosure;

[0029] Figure 2 Structural schematic diagram of a convolutional coding hardware circuit provided by the present disclosure;

[0030] Figure 3 Structural schematic diagram of a communication device provided by the present disclosure;

[0031] Figure 4 Flow schematic diagram of a communication method provided by the present disclosure;

[0032] Figure 5 Schematic diagram of the performance of block error rate provided by the present disclosure;

[0033] Figure 6 Schematic diagram of another block error rate performance provided by the present disclosure;

[0034] Figure 7 Schematic diagram of another block error rate performance provided by the present disclosure;

[0035] Figure 8 Schematic diagram of another block error rate performance provided by the present disclosure;

[0036] Figure 9 Schematic diagram of another block error rate performance provided by the present disclosure;

[0037] Figure 10 Schematic diagram of another block error rate performance provided by the present disclosure;

[0038] Figure 11 Flow schematic diagram of another communication method provided by the present disclosure;

[0039] Figure 12 Structural schematic diagram of another communication device provided by the present disclosure;

[0040] Figure 13 Structural schematic diagram of another communication device provided by the present disclosure;

[0041] Figure 14 Structural schematic diagram of another communication device provided by the present disclosure. Detailed implementation manners

[0042] The following will clearly and completely describe the technical solutions in the present disclosure in conjunction with the accompanying drawings in the present disclosure. Obviously, the described embodiments are only a part of the embodiments of the present disclosure, rather than all the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present disclosure.

[0043] It should be noted that in the present disclosure, words such as "exemplary" or "for example" are used to represent examples, illustrations or explanations. Any embodiment or design solution described as "exemplary" or "for example" in the present disclosure should not be construed as being more preferred or having more advantages than other embodiments or design solutions. Rather, the use of words such as "exemplary" or "for example" is intended to present relevant concepts in a specific manner.

[0044] Hereinafter, the terms "first" and "second" are only used for descriptive purposes and cannot be understood as indicating or implying relative importance or implicitly specifying the quantity of the indicated technical features. Thus, the features defined with "first" and "second" may explicitly or implicitly include one or more of such features.

[0045] In the description of the present disclosure, unless otherwise specified, " / " means "or". For example, A / B may represent A or B. The "and / or" herein is only a description of the association relationship of the associated objects, indicating that there can be three relationships. For example, A and / or B may represent: A exists alone, A and B exist simultaneously, and B exists alone. In addition, "at least one" means one or more, and "a plurality" means two or more.

[0046] With the rapid development of technologies such as big data, cloud computing, and delay-sensitive networks, the number of user devices in wireless communication networks has shown an explosive growth. Wireless communication networks will carry diverse applications and massive amounts of data, which poses high requirements for data transmission rate, throughput, reliability, delay, etc. Currently, with the development of intelligent transportation, intelligent industrial control, intelligent logistics, etc., the communication requirements for ultra-low delay and ultra-high reliability are becoming increasingly strong, that is, some short packet data needs to be sent and successfully received within an extremely short time.

[0047] However, the current channel coding for short packets is relatively complex, and there is a problem of relatively high transmission delay.

[0048] To solve the above technical problems, the embodiments of the present disclosure provide a communication method, which processes an information bit sequence through a coding rate and / or a repetition number to generate and send a first sequence. Compared with the coding and sending process in the traditional technology, the complexity is lower, the delay is lower, and the ability requirement for the first node is lower.

[0049] For example, the systems to which the communication method provided by the embodiments of the present disclosure can be applied include, but are not limited to, long term evolution (LTE) systems, various versions evolved from LTE, fifth generation (5G) communication systems, 5G-A communication systems, Wi-Fi systems, communication systems related to the 3rd generation partnership project (3GPP), future evolved communication systems (such as: sixth generation (6G) communication systems or seventh generation (7G) communication systems, etc.), or systems integrating multiple systems, etc., without limitation.

[0050] Exemplarily, the above communication method can be applied to a communication system as Figure 1 described, as Figure 1 shown, the communication system includes: a first node 101 and a second node 102.

[0051] Among them, the first node 101 is configured to receive control information from the second node; or to determine a coding rate and / or a repetition number based on the control information; or to generate a first sequence based on an information bit sequence and the coding rate and / or the repetition number; or to send the first sequence to the second node.

[0052] The second node 102 is configured to send control information to the first node, the control information being used to determine a coding rate and / or a repetition number; or to receive the first sequence sent by the first node; or to perform processing on the first sequence based on the coding rate and / or the repetition number to obtain an information bit sequence.

[0053] In some embodiments, the first node 101 may be a terminal.

[0054] In some embodiments, the second node 102 may be a network device or a base station.

[0055] In some embodiments, a terminal may also be referred to as a terminal device, user equipment (UE), mobile station, mobile terminal, etc. The terminal device may be an Internet of Things (IoT) device, which is used to collect various information and then forward error correction code the data information and send the data to the base station. The terminal device may also be a mobile device such as a mobile phone, a tablet computer, a computer with wireless transceiver function, a car, a tram, etc. In addition, the terminal device may be fixed or mobile. Various types of terminal devices may also include or be referred to by those skilled in the art as mobile stations, user stations, mobile units, user units, wireless units, remote units, mobile devices, wireless devices, wireless communication devices, remote devices, mobile user stations, access terminals, mobile terminals, wireless terminals, remote terminals, handheld devices, user agents, mobile clients, clients, passive tags, devices, or some other possible devices. Moreover, various types of UEs may also be cellular phones, personal digital assistants (PDAs), wireless modems, wireless communication devices, handheld devices, tablet computers, laptop computers, cordless phones, wireless local loop (WLL) stations, and so on. Various types of UEs can communicate with various types of base stations and network devices (including macro eNBs, small cell eNBs, relay base stations, etc.). The wireless communication system may also include an IoT system or be a part of an IoT system.

[0056] In some embodiments, for various user equipment of passive IoT communication, according to the energy storage capacity and signal transmission capacity of the user equipment, various different user equipment can be classified into the following three device types: Device type 1: Passive, without energy storage devices, with a peak power consumption of about 1 microwatt, and sending signals in a backscattering manner; Device type 2: Semi-active, with a small amount of energy storage devices, with a peak power consumption of about several hundred microwatts, and sending signals from the device to the reader in a backscattering manner; Device type 3: Active, with energy storage devices, with a peak power consumption of about several hundred microwatts, and autonomously generating and sending signals.

[0057] In addition, user devices with various capabilities can also be classified into: Device Type 1 (Device1), Device Type 2a (Device 2a), and Device Type 2b (Device 2b). Among them, Device Type 1 (Device 1) has a peak power consumption of ~1 μW, has an energy storage function, does not have amplifiers for uplink and downlink signals in the device, and transmits the transmission signal through backscattering on an externally provided carrier during uplink transmission. Device Type 2a (Device 2a) has a peak power consumption ≤ several hundred μW, has an energy storage function, has amplifiers for uplink and downlink signals in the device, and transmits the transmission signal through backscattering on an externally provided carrier during uplink transmission. Device Type 2a (Device 2a) has a peak power consumption ≤ several hundred μW, has an energy storage function, has amplifiers for uplink and downlink signals in the device, and transmits the transmission signal through the capabilities within the device during uplink transmission.

[0058] In some embodiments, the network device can be used to implement functions such as resource scheduling, radio resource management, and radio access control of the terminal device. Specifically, the network device can be any one of a base station transceiver, a radio base station, a radio transceiver, a small base station, a wireless access point, a transmission receive point (TRP), a transmission point (TP), an evolved Node B (eNB), a gNodeB, a home Node B, a home evolved Node B, a reader, a reader, and some other access nodes. In some embodiments, the communication system may also include different types of base stations, such as macro cell base stations and / or small cell base stations.

[0059] In some embodiments, the base station can be a base station in Long Term Evolution (LTE), Long Term Evolution Advanced (LTEA), or an evolved base station (eNodeB), a base station device in a 5G network, or a base station in a future communication system, etc. The base station can include various macro base stations, micro base stations, home base stations, remote radio heads, reconfigurable intelligent surfaces (RISs), routers, wireless fidelity (WIFI) devices, or various network-side devices such as a primary cell and a secondary cell.

[0060] It should be noted that Figure 1 is only an exemplary framework diagram Figure 1The number of devices included is not limited by the name of each device.

[0061] As Figure 2 shown, it is a schematic structural diagram of a convolutional coding hardware circuit provided by an embodiment of the present disclosure, including 6 shift registers (denoted by D in the figure). At this time, the constraint length of the convolutional coding is equal to 7.

[0062] Exemplarily, assuming that the mother code rate of the convolutional coding is 1 / 3, at this time, there are 3 generating polynomials represented in octal: 133, 171, and 165. These 3 polynomials are represented by the following generating polynomials: G0(D) = 1 + D 2 + D 3 + D 5 + D 6 ; G1(D) = 1 + D 1 + D 2 + D 3 + D 6 ; G2(D) = 1 + D 1 + D 2 + D 4 + D 6 . For the 0th generating polynomial G0(D), the bits output after its corresponding encoding are the output bits of the 0th component code; for the 1st generating polynomial G1(D), the bits output after its corresponding encoding are the output bits of the 1st component code; for the 2nd generating polynomial G2(D), the bits output after its corresponding encoding are the output bits of the 2nd component code.

[0063] Exemplarily, assuming that the information bit sequence is c, c1, c2, c3, …, c K-1 . The input of the circuit is the kth bit ck k of the information bit sequence, and after encoding processing, 3 bits are output. The number of shift registers passed through, that is, the number of clock beats corresponding to the delay, can be determined based on the power of "D" in the polynomial.

[0064] For example, for the 0th component code, its corresponding generating polynomial is G0(D) = 1 + D 2 + D 3 + D 5 + D 6 , which means that the output bits of the component code corresponding to this generating polynomial are the result of XOR of the non-delayed bit (1 information bit), the output of the 2nd shift register (after passing through 2 delay elements), the output of the 3rd shift register (after passing through 3 delay elements), the output of the 5th shift register (after passing through 5 delay elements), and the output of the 6th shift register (after passing through 6 delay elements). That is, the input is the kth bit of the information bit sequence, and the output bit of the 0th component code is

[0065] For the first component code, its polynomial is G1(D) = 1 + D 1 + D 2 + D 3 + D 6 , indicating that the output bit of the component code corresponding to this generating polynomial is the result of the exclusive OR of the non-delayed bit (1 information bit), the output of the first shift register (after 1 delay element), the output of the second shift register (after 2 delay elements), the output of the third shift register (after 3 delay elements), and the output of the sixth shift register (after 6 delay elements). That is, when the input is the k-th bit of the information bit sequence, the output bit of the first component code is

[0066] For the second component code, the corresponding polynomial is G2(D) = 1 + D 1 + D 2 + D 4 + D 6 indicating that the output bit of the component code corresponding to this generating polynomial is the result of the exclusive OR of the non-delayed bit (1 information bit), the output of the first shift register (after 1 delay element), the output of the second shift register (after 2 delay elements), the output of the fourth shift register (after 4 delay elements), and the output of the sixth shift register (after 6 delay elements). That is, when the input is the k-th bit of the information bit sequence, the output bit of the first component code is The output bits of the 3 component codes constitute the encoded bit subsequence.

[0067] When the required output coding rate is equal to 1 / 2, this convolutional coding can output the 0th component code and the 1st component code. When the required output coding rate is equal to 1 / 3, this convolutional coding can output the 0th component code, the 1st component code, and the 2nd component code.

[0068] As Figure 3 shown, it is a schematic structural diagram of a communication device provided by an embodiment of the present disclosure, including: a memory 301, a processor 302, and a transceiver 303.

[0069] Among them, the memory 301 may include a data storage 3011, and the data storage 3011 can be used as a local cache for control information, information bit sequences, the first sequence, etc. In addition, the memory 301 may further include a non-transitory computer-readable storage medium (e.g., one or more non-volatile memory elements, such as Erasable Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), flash memory, hard disk drive, etc.), which can store the following software modules: the data storage 3011 and the program module 3012.

[0070] The processor 302 (coupled between the memory 301 and the transceiver 303) can be any suitable processor capable of executing the instructions or scripts of one or more software programs stored in the communication device (e.g., within the memory 301). For example, the processor 302 can execute the program module 3012.

[0071] The transceiver 303 can be used to send or receive data to / from a receiving end. The non-transitory computer-readable storage medium of the memory 301 may include instructions for performing all or part of the operations described above. It should be noted that although the program module 3012 is depicted as software in the memory 301, any of these modules can be implemented in software, firmware, or a combination of the foregoing.

[0072] It should be noted that Figure 3 The illustrated communication device can be a user equipment or a tag device or a network device or a reader.

[0073] In some embodiments, Figure 3 When the illustrated communication device is a user equipment or a tag device, the processor 302 is configured to receive control information from a second node; or to determine a coding rate and / or a repetition number based on the control information; or to generate a first sequence based on an information bit sequence and the coding rate and / or the repetition number; or to send the first sequence to the second node.

[0074] In some embodiments, Figure 3 When the illustrated communication device is a network device or a reader, the processor 302 is configured to send control information to a first node, where the control information is used to determine a coding rate and / or a repetition number; or to receive the first sequence sent by the first node; or to perform processing on the first sequence based on the coding rate and / or the repetition number to obtain an information bit sequence.

[0075] The application scenarios of the embodiments of the present disclosure are not limited. The system architecture and business scenarios described in the embodiments of the present disclosure are for more clearly explaining the technical solutions of the embodiments of the present disclosure, and do not constitute a limitation on the technical solutions provided by the embodiments of the present disclosure. Those skilled in the art know that with the evolution of the network architecture and the emergence of new business scenarios, the technical solutions provided by the embodiments of the present disclosure are equally applicable to similar technical problems.

[0076] Next, the communication method provided by the embodiments of the present disclosure will be introduced in detail with reference to the accompanying drawings.

[0077] The communication method provided by the embodiments of the present disclosure can be applied to Figure 1 the first node 101 in the communication system shown in Figure 4 FIG. shows a schematic flow diagram of a communication method, as Figure 4 shown, the communication method includes the following S401-S404:

[0078] S401. Receive control information from a second node.

[0079] S402. Determine the coding rate and / or the number of repetitions based on the control information.

[0080] S403. Generate a first sequence based on the information bit sequence, and the coding rate and / or the number of repetitions.

[0081] S404. Send the first sequence to the second node.

[0082] It should be understood that during data transmission, due to the influence of factors such as multipath, noise, and interference, data transmission errors may occur. At this time, the sending end can add redundant information to the transmitted data, and the receiving end can recover the original data to be transmitted through the redundant information. The coding rate can indicate the ratio between the number of effective information bits and the total number of bits after coding. The second node can make the first node add redundant information and perform coding based on the coding rate indicated / configured / scheduled by the second node through the control information, so as to improve the reliability of data transmission.

[0083] During data transmission, the sending end can repeat the coded bit sequence, and the receiving end can receive and decode the repeated coded bit sequence to obtain multiple decoded data, and select the data with the highest accuracy rate or the lowest error rate or the highest transmission reliability from them; or the multiple repeated bit sequences can be merged and then decoded to improve the decoding performance. Therefore, the second node can make the first node repeat the coded bit sequence based on the number of repetitions indicated / configured / scheduled by the second node through the control information, so as to improve the reliability of data transmission.

[0084] It should be noted that processing the information bit sequence through the coding code rate and / or the number of repetitions to generate and send the first sequence has lower complexity, lower latency, and lower requirements for the capabilities of the first node compared to the coding and sending processes in traditional technologies. Moreover, it can enhance the coverage ability of the system and improve the robustness of the communication system.

[0085] In some embodiments, the coding code rate is used to perform coding on the information bit sequence to obtain the coded bit sequence. In one example, when the convolutional coding introduced above is adopted for this coding method, when the coding code rate is equal to 1 / 2, the convolutional coding can output all the bits of the 0th component code and all the bits of the 1st component code. When the coding code rate is equal to 1 / 3, the convolutional coding can output all the bits of the 0th component code, all the bits of the 1st component code, and all the bits of the 2nd component code.

[0086] When the coding code rate is equal to 2 / 3, the convolutional coding can output all the bits of the 0th component code and K / 2 bits in the 1st component code, or output K / 2 bits in the 0th component code and all the bits in the 1st component code, or output 3K / 4 bits in the 0th component code and 3K / 4 bits in the 1st component code.

[0087] When the coding code rate is equal to 3 / 4, the convolutional coding can output all the bits of the 0th component code and K / 3 bits in the 1st component code, or output K / 3 bits in the 0th component code and all the bits in the 1st component code, or output 2K / 3 bits in the 0th component code and 2K / 3 bits in the 1st component code.

[0088] When the coding code rate is equal to 4 / 5, the convolutional coding can output all the bits of the 0th component code and K / 4 bits in the 1st component code, or output K / 4 bits in the 0th component code and all the bits in the 1st component code, or output 5K / 8 bits in the 0th component code and 5K / 8 bits in the 1st component code.

[0089] When the coding code rate is equal to 5 / 6, the convolutional coding can output all the bits of the 0th component code and K / 5 bits in the 1st component code, or output K / 5 bits in the 0th component code and all the bits in the 1st component code, or output 3K / 5 bits in the 0th component code and 3K / 5 bits in the 1st component code.

[0090] When the coding code rate is equal to 6 / 7, the convolutional coding can output all the bits of the 0th component code and K / 6 bits in the 1st component code, or output K / 6 bits in the 0th component code and all the bits in the 1st component code, or output 7K / 12 bits in the 0th component code and 7K / 12 bits in the 1st component code.

[0091] When the coding rate is equal to 7 / 8, the convolutional coding can output all the bits of the 0th component code and K / 7 bits of the 1st component code, or output K / 7 bits of the 0th component code and all the bits of the 1st component code, or output 4K / 7 bits of the 0th component code and 4K / 7 bits of the 1st component code.

[0092] When the coding rate is equal to 8 / 9, the convolutional coding can output all the bits of the 0th component code and K / 8 bits of the 1st component code, or output K / 8 bits of the 0th component code and all the bits of the 1st component code, or output 9K / 16 bits of the 0th component code and 9K / 16 bits of the 1st component code.

[0093] When the coding rate is equal to 3 / 5, the convolutional coding can output all the bits of the 0th component code and 2K / 3 bits of the 1st component code, or output 2K / 3 bits of the 0th component code and all the bits of the 1st component code, or output 5K / 6 bits of the 0th component code and 5K / 6 bits of the 1st component code.

[0094] When the coding rate is equal to 5 / 8, the convolutional coding can output all the bits of the 0th component code and 3K / 5 bits of the 1st component code, or output 3K / 5 bits of the 0th component code and all the bits of the 1st component code, or output 4K / 5 bits of the 0th component code and 4K / 5 bits of the 1st component code.

[0095] In some embodiments, the number of repetitions is used to perform a repetition process on the encoded bit sequence to obtain a first sequence. It should be noted that for the number of repetitions equal to 1, it means only sending 1 copy of the encoded bit sequence; for the number of repetitions equal to 2, it means only sending 2 copies of the encoded bit sequence; that is, for the number of repetitions equal to Rep, it means sending Rep copies of the encoded bit sequence. In one example, the repetition process is performed in units of blocks. For example, when performing a repetition process with a repetition number of 2 on the encoded bit sequence, the obtained first sequence is [encoded bit sequence, encoded bit sequence]. In another example, the repetition process is performed in units of bits.

[0096] In some embodiments, the coding rate includes at least one of the following: 1, 8 / 9, 7 / 8, 6 / 7, 5 / 6, 4 / 5, 3 / 4, 2 / 3, 3 / 5, 5 / 8, 1 / 2, 1 / 3.

[0097] In some embodiments, the number of repetitions includes at least one of the following: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 22, 24, 32, 36, 40, 48, 56, 64.

[0098] In some embodiments, determining the coding code rate and / or the number of repetitions based on control information includes: determining the coding code rate and the number of repetitions from a parameter list based on the control information; the parameter list includes N candidate combinations, and one candidate combination includes a candidate coding code rate and a candidate number of repetitions, where N is a positive integer.

[0099] When sampling multiple coding code rates and / or multiple numbers of repetitions to process the information bit sequence, since the BLER performance curves corresponding to various combinations of coding code rates and numbers of repetitions are different. To enable the base station or the reader to more efficiently select a combination of a coding code rate and a number of repetitions for coding and repetition operations, it is necessary to specifically design the coding code rates and numbers of repetitions of various candidate combinations in the parameter list to ensure that the intervals (in decibels dB, corresponding to the signal-to-noise ratio SNR) between each BLER performance curve are as uniform as possible, that is, to minimize the SNR gap so as to support flexible resource allocation.

[0100] In some embodiments, a combination formed by a candidate coding code rate and a candidate number of repetitions is referred to as a coding repetition strategy.

[0101] In some embodiments, the control information is carried on a bit sequence, and the bit sequence includes n bits for indicating an index of a candidate combination or a candidate combination in the parameter list, where 2 to the power of n is equal to N, and n is a positive integer.

[0102] In some embodiments, n is 1, and the parameter list is one of the following:

[0103] {1, 1}, {1 / 3, 1}; {1, 1}, {1 / 3, 2}; {1, 1}, {1 / 3, 3}; {1, 1}, {1 / 3, 4}; {1, 1}, {1 / 3, 5}; {1, 1}, {1 / 3, 6}; {1, 1}, {1 / 3, 8}; {1, 1}, {1 / 3, 10}; {1, 1}, {1 / 3, 12}; {1, 1}, {1 / 3, 16}; {1, 1}, {1 / 3, 24}; {1, 1}, {1 / 3, 32}; {1, 1}, {1 / 3, 48}.

[0104] In some embodiments, n is 2, and the repetition times corresponding to the coding code rate equal to 1 / 2 in the parameter list are equal to 1 or 2. In some other embodiments, n is 2, and the maximum value of the repetition times corresponding to the coding code rate equal to 1 / 2 in the parameter list is equal to 2, and / or the minimum value is equal to 1. In some other embodiments, n is 2, and the minimum value of the repetition times corresponding to the coding code rate equal to 1 / 3 in the parameter list is equal to 1. In some other embodiments, n is 2, and the maximum value of the repetition times corresponding to the coding code rate equal to 1 / 3 in the parameter list is equal to 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 16, 20, 24, 28, 32, 36 or 40. In some other embodiments, n is 2, and the number of candidate combinations corresponding to the coding code rate equal to 1 / 3 in the parameter list is equal to 2 or 3.

[0105] In some other embodiments, n is 2, and the number of candidate combinations corresponding to the coding code rate equal to 1 / 3 in the parameter list is equal to 3. The difference between the ratio of the repetition times of the first candidate combination and the 0th candidate combination and the ratio of the repetition times of the second candidate combination and the first candidate combination among the 3 candidate combinations is not greater than 0.1, 0.2, 0.3, 0.5, 1, 1.5, 2 or 3.

[0106] In some other embodiments, n is 2, and the number of candidate combinations corresponding to the coding code rate equal to 1 / 3 in the parameter list is equal to 3. The ratio of the repetition times of the first candidate combination and the 0th candidate combination among the 3 candidate combinations is equal to the ratio of the repetition times of the second candidate combination and the first candidate combination. In some other embodiments, the ratio is equal to 1.5, 2, 3, 4, 5, 6, 7 or 8.

[0107] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 2}, {1 / 3, 6}.

[0108] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 6}.

[0109] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}.

[0110] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 4}, {1 / 3, 16}.

[0111] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 24}.

[0112] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 25}.

[0113] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 23}.

[0114] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 6}, {1 / 3, 36}.

[0115] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 3}, {1 / 3, 9}.

[0116] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 5}, {1 / 3, 25}.

[0117] In some embodiments, n is 2, and the parameter list is one of the following:

[0118] 0: {1, 1}, {1 / 2, 1}, {1 / 3, 2}, {1 / 3, 6};

[0119] 1: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 6};

[0120] 2: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4};

[0121] 3: {1, 1}, {1 / 3, 1}, {1 / 3, 4}, {1 / 3, 16};

[0122] 4: {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 24};

[0123] 5: {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 25};

[0124] 6: {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 23}.

[0125] 7: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2};

[0126] 8：{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、6}；

[0127] 9：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、8}；

[0128] 10：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、8}；

[0129] 11：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、16}；

[0130] 12：{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、6}；

[0131] 13：{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、12}；

[0132] 14：{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、12}。

[0133] 15：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、3}；

[0134] 16：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}；

[0135] 17：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、4}；

[0136] 18：{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、4}；

[0137] 19：{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、4}；

[0138] 20：{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、5}；

[0139] 21：{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、5}；

[0140] 22：{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、5}；

[0141] 23：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、5}；

[0142] 24：{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、6}；

[0143] 25：{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、6}；

[0144] 26：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、6}；

[0145] 27：{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、6}；

[0146] 28：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、8}；

[0147] 29：{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、8}；

[0148] 30：{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、8}；

[0149] 31：{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、8}；

[0150] 32：{1、1}，{1 / 2、1}，{1 / 3、5}，{1 / 3、8}；

[0151] 33：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、8}；

[0152] 34：{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、8}；

[0153] 35：{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、8}；

[0154] 36：{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、8}；

[0155] 37：{1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、8}；

[0156] 38：{1、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、8}；

[0157] 39：{1、1}，{1 / 3、2}，{1 / 3、4}，{1 / 3、8}；

[0158] 40：{1、1}，{1 / 3、2}，{1 / 3、5}，{1 / 3、8}；

[0159] 41：{1、1}，{1 / 3、2}，{1 / 3、6}，{1 / 3、8}；

[0160] 42：{1、1}，{1 / 3、3}，{1 / 3、5}，{1 / 3、8}；

[0161] 43：{1、1}，{1 / 3、3}，{1 / 3、6}，{1 / 3、8}；

[0162] 44：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、10}；

[0163] 45：{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、10}；

[0164] 46：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、10}；

[0165] 47：{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、10}；

[0166] 48：{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、10}；

[0167] 49：{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、10}；

[0168] 50：{1、1}，{1 / 3、2}，{1 / 3、4}，{1 / 3、10}；

[0169] 51：{1、1}，{1 / 3、2}，{1 / 3、5}，{1 / 3、10}；

[0170] 52：{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、12}；

[0171] 53：{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、12}；

[0172] 54：{1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、12}；

[0173] 55：{1、1}，{1 / 3、1}，{1 / 3、7}，{1 / 3、12}；

[0174] 56：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}；

[0175] 57: {1, 1}, {1 / 3, 1}, {1 / 3, 8}, {1 / 3, 12}. In some embodiments, n is 2, and the parameter list is one of the following: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 2, 2};

[0176] {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2};

[0177] {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2};

[0178] {1, 1}, {1 / 3, 1}, {1 / 2, 2}, {1 / 3, 2};

[0179] {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3};

[0180] {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 3};

[0181] {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4};

[0182] {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 4};

[0183] {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 5};

[0184] {1, 1}, {1 / 2, 1}, {1 / 3, 2}, {1 / 3, 5};

[0185] {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 6};

[0186] {1, 1}, {1 / 2, 1}, {1 / 3, 2}, {1 / 3, 6};

[0187] {1, 1}, {1 / 3, 1}, {1 / 3, 3}, {1 / 3, 7};

[0188] {1, 1}, {1 / 2, 1}, {1 / 3, 2}, {1 / 3, 7};

[0189] {1, 1}, {1 / 3, 1}, {1 / 3, 3}, {1 / 3, 8};

[0190] {1, 1}, {1 / 2, 1}, {1 / 3, 2}, {1 / 3, 8};

[0191] {1, 1}, {1 / 3, 1}, {1 / 3, 3}, {1 / 3, 9};

[0192] {1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、9}；

[0193] {1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、10}；

[0194] {1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、10}；

[0195] {1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、11}；

[0196] {1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、11}；

[0197] {1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、12}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、12}；{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、13}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、13}；{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、14}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、14}；{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、15}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、15}；{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、16}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、16}；{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、17}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、17}；{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、18}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、18}；{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、19}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、19}；{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、20}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、20}；{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、21}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、21}；{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、22}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、22}；{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、23}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、23}；{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、24}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、24}；{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、25}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、25}；{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、26}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、26}；{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、27}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、27}；{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、28}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、28}；{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、29}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、29}；{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、30}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、30}；{1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、31}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、31}；

[0198] {1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、32}；

[0199] {1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、32}；

[0200] {1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、33}；

[0201] {1、1}，{1 / 2、1}，{1 / 3、5}，{1 / 3、33}；

[0202] {1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、34}；

[0203] {1、1}，{1 / 2、1}，{1 / 3、5}，{1 / 3、34}；

[0204] {1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、35}；

[0205] {1、1}，{1 / 2、1}，{1 / 3、5}，{1 / 3、35}；

[0206] {1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、36}；

[0207] {1、1}，{1 / 2、1}，{1 / 3、5}，{1 / 3、36}；

[0208] {1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、37}；

[0209] {1、1}，{1 / 2、1}，{1 / 3、5}，{1 / 3、37}；

[0210] {1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、38}；

[0211] {1, 1}, {1 / 2, 1}, {1 / 3, 5}, {1 / 3, 38};

[0212] {1, 1}, {1 / 3, 1}, {1 / 3, 6}, {1 / 3, 39};

[0213] {1, 1}, {1 / 2, 1}, {1 / 3, 5}, {1 / 3, 39};

[0214] {1, 1}, {1 / 3, 1}, {1 / 3, 6}, {1 / 3, 40};

[0215] {1, 1}, {1 / 2, 1}, {1 / 3, 5}, {1 / 3, 40}.

[0216] In some embodiments, n is 3, and the repetition times corresponding to the coding code rate equal to 1 / 2 in the parameter list are equal to 1 or 2. In some other embodiments, n is 3, the maximum value of the repetition times corresponding to the coding code rate equal to 1 / 2 in the parameter list is equal to 2, and / or the minimum value is equal to 1.

[0217] In some other embodiments, n is 3, and the minimum value of the repetition times corresponding to the coding code rate equal to 1 / 3 in the parameter list is equal to 1. In some other embodiments, n is 3, and the number of candidate combinations corresponding to the coding code rate equal to 1 / 3 in the parameter list is equal to 5, 6, or 7. In some other embodiments, n is 3, and the maximum value of the repetition times corresponding to the coding code rate equal to 1 / 3 in the parameter list is equal to 5, 6, 7, 8, 9, 10, 12, 16, 20, 24, 28, 32, 36, or 40.

[0218] In some other embodiments, n is 3, and for any two adjacent repetition times in the candidate combinations corresponding to the coding code rate equal to 1 / 3 in the parameter list, the ratio (the value obtained by dividing the larger repetition time by the smaller repetition time) is not greater than 1.1, 1.2, 1.5, 1.8, 2, 2.2, 2.5, 3, or 4.

[0219] In some other embodiments, n is 3, and for all ratios (the values obtained by dividing the larger repetition time by the smaller repetition time) of any two adjacent repetition times in the candidate combinations corresponding to the coding code rate equal to 1 / 3 in the parameter list, the difference between the maximum ratio and the minimum ratio is not greater than 0.1, 0.2, 0.3, 0.5, 1, 1.5, 2, 3, or 4.

[0220] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}, {1 / 3, 32}.

[0221] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}, {1 / 3, 32}.

[0222] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}.

[0223] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}.

[0224] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}.

[0225] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 8}.

[0226] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 12}, {1 / 3, 16}.

[0227] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}.

[0228] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 6}, {1 / 3, 8}, {1 / 3, 12}, {1 / 3, 16}.

[0229] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 5}, {1 / 3, 8}, {1 / 3, 14}, {1 / 3, 24}.

[0230] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 7}, {1 / 3, 13}, {1 / 3, 24}.

[0231] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 9}, {1 / 3, 17}, {1 / 3, 32}.

[0232] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 6}, {1 / 3, 11}, {1 / 3, 20}, {1 / 3, 36}.

[0233] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 5}, {1 / 3, 9}, {1 / 3, 18}, {1 / 3, 36}.

[0234] In some embodiments, n is 3, and the parameter list is one of the following:

[0235] 1: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}, {1 / 3, 32};

[0236] 2: {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}, {1 / 3, 32}.

[0237] 3: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 6}, {1 / 3, 8};

[0238] 4: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 8};

[0239] 5：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、3}，{1 / 3、5}，{1 / 3、7}，{1 / 3、8}；

[0240] 6：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、5}，{1 / 3、7}，{1 / 3、8}；

[0241] 8：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、3}，{1 / 3、5}，{1 / 3、7}，{1 / 3、9}；

[0242] 9：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、5}，{1 / 3、7}，{1 / 3、9}；

[0243] 10：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、5}，{1 / 3、7}，{1 / 3、9}；

[0244] 11：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、6}，{1 / 3、8}，{1 / 3、10}；

[0245] 12：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、3}，{1 / 3、5}，{1 / 3、7}，{1 / 3、10}；

[0246] 13：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、6}，{1 / 3、8}，{1 / 3、10}；

[0247] 14：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、5}，{1 / 3、7}，{1 / 3、9}，{1 / 3、10}；

[0248] 15：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、5}，{1 / 3、8}，{1 / 3、10}；

[0249] 16：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、6}，{1 / 3、8}，{1 / 3、12}；

[0250] 17：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、7}，{1 / 3、9}，{1 / 3、12}；

[0251] 18：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、8}，{1 / 3、10}，{1 / 3、12}；

[0252] 19：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、4}、{1 / 3、6}，{1 / 3、8}，{1 / 3、10}，{1 / 3、12}；

[0253] 20：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、5}，{1 / 3、7}，{1 / 3、9}，{1 / 3、12}；

[0254] 21：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、7}，{1 / 3、10}，{1 / 3、12}；

[0255] 22：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、8}，{1 / 3、10}，{1 / 3、12}；

[0256] 23：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、6}，{1 / 3、9}，{1 / 3、12}；

[0257] 24：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、6}，{1 / 3、10}，{1 / 3、14}；

[0258] 25：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、8}，{1 / 3、11}，{1 / 3、14}；

[0259] 26：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、7}，{1 / 3、10}，{1 / 3、14}；

[0260] 27：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、4}、{1 / 3、8}，{1 / 3、10}，{1 / 3、12}，{1 / 3、14}；

[0261] 28：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、5}，{1 / 3、7}，{1 / 3、10}，{1 / 3、14}；

[0262] 29：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、7}，{1 / 3、10}，{1 / 3、14}；

[0263] 30：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、5}，{1 / 3、10}，{1 / 3、14}；

[0264] 31：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、5}，{1 / 3、8}，{1 / 3、11}，{1 / 3、14}；

[0265] 32：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、8}，{1 / 3、12}，{1 / 3、16}；

[0266] 33：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、3}，{1 / 3、4}，{1 / 3、8}，{1 / 3、16}；

[0267] 34：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、4}、{1 / 3、6}，{1 / 3、8}，{1 / 3、12}，{1 / 3、16}；

[0268] 35：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、5}，{1 / 3、8}，{1 / 3、12}，{1 / 3、16}；

[0269] 36：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、6}，{1 / 3、11}，{1 / 3、16}；

[0270] 37：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、8}，{1 / 3、14}，{1 / 3、20}；

[0271] 38: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 5}, {1 / 3, 10}, {1 / 3, 20};

[0272] 39: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 12}, {1 / 3, 16}, {1 / 3, 20};

[0273] 40: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 6}, {1 / 3, 10}, {1 / 3, 14}, {1 / 3, 20};

[0274] 41: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 7}, {1 / 3, 11}, {1 / 3, 15}, {1 / 3, 20};

[0275] 42: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}, {1 / 3, 24};

[0276] 43: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}, {1 / 3, 24};

[0277] 44: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 7};

[0278] 45: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 6}, {1 / 3, 7};

[0279] 46: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7};

[0280] 47: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}.

[0281] In some embodiments, n is 3, and the parameter list is one of the following:

[0282] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}；

[0283] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、6}；

[0284] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}；

[0285] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、7}；

[0286] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、8}；

[0287] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、8}；

[0288] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、9}；

[0289] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、6}，{1 / 3、9}；

[0290] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、7}，{1 / 3、10}；

[0291] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、6}，{1 / 3、10}；

[0292] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、7}，{1 / 3、11}；

[0293] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、7}，{1 / 3、11}；

[0294] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、8}，{1 / 3、12}；

[0295] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、7}，{1 / 3、12}；

[0296] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、6}，{1 / 3、9}，{1 / 3、13}；

[0297] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、8}，{1 / 3、13}；

[0298] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、6}，{1 / 3、9}，{1 / 3、14}；

[0299] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、8}，{1 / 3、14}；

[0300] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、6}，{1 / 3、10}，{1 / 3、15}；

[0301] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、9}，{1 / 3、15}；

[0302] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、6}，{1 / 3、10}，{1 / 3、16}；

[0303] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、9}，{1 / 3、16}；

[0304] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、7}，{1 / 3、11}，{1 / 3、17}；

[0305] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、10}，{1 / 3、17}；

[0306] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、7}，{1 / 3、11}，{1 / 3、18}；

[0307] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、10}，{1 / 3、18}；

[0308] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、7}，{1 / 3、12}，{1 / 3、19}；

[0309] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、11}，{1 / 3、19}；

[0310] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、7}，{1 / 3、12}，{1 / 3、20}；

[0311] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、4}，{1 / 3、6}，{1 / 3、11}，{1 / 3、20}；

[0312] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、8}，{1 / 3、13}，{1 / 3、21}；

[0313] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、7}，{1 / 3、12}，{1 / 3、21}；

[0314] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、8}，{1 / 3、13}，{1 / 3、22}；

[0315] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、7}，{1 / 3、12}，{1 / 3、22}；

[0316] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、8}，{1 / 3、14}，{1 / 3、23}；

[0317] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、7}，{1 / 3、13}，{1 / 3、23}；

[0318] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、8}，{1 / 3、14}，{1 / 3、24}；

[0319] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、7}，{1 / 3、13}，{1 / 3、24}；

[0320] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、9}，{1 / 3、15}，{1 / 3、25}；

[0321] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、7}，{1 / 3、14}，{1 / 3、25}；

[0322] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、9}，{1 / 3、15}，{1 / 3、26}；

[0323] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、7}，{1 / 3、14}，{1 / 3、26}；

[0324] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、9}，{1 / 3、16}，{1 / 3、27}；

[0325] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、8}，{1 / 3、14}，{1 / 3、27}；

[0326] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、9}，{1 / 3、16}，{1 / 3、28}；

[0327] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、8}，{1 / 3、15}，{1 / 3、28}；

[0328] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、9}，{1 / 3、16}，{1 / 3、29}；

[0329] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、8}，{1 / 3、15}，{1 / 3、29}；

[0330] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、10}，{1 / 3、17}，{1 / 3、30}；

[0331] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、8}，{1 / 3、16}，{1 / 3、30}；

[0332] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、10}，{1 / 3、17}，{1 / 3、31}；

[0333] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、8}，{1 / 3、16}，{1 / 3、31}；

[0334] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、10}，{1 / 3、18}，{1 / 3、32}；

[0335] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、9}，{1 / 3、17}，{1 / 3、32}；

[0336] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、10}，{1 / 3、18}，{1 / 3、33}；

[0337] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、5}，{1 / 3、9}，{1 / 3、17}，{1 / 3、33}；

[0338] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、10}，{1 / 3、19}，{1 / 3、34}；

[0339] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、5}，{1 / 3、9}，{1 / 3、17}，{1 / 3、34}；

[0340] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、11}，{1 / 3、19}，{1 / 3、35}；

[0341] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、5}，{1 / 3、9}，{1 / 3、18}，{1 / 3、35}；

[0342] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、11}，{1 / 3、20}，{1 / 3、36}；

[0343] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、5}，{1 / 3、9}，{1 / 3、18}，{1 / 3、36}；

[0344] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、11}，{1 / 3、20}，{1 / 3、37}；

[0345] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、5}，{1 / 3、10}，{1 / 3、19}，{1 / 3、37}；

[0346] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、11}，{1 / 3、21}，{1 / 3、38}；

[0347] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、5}，{1 / 3、10}，{1 / 3、19}，{1 / 3、38}；

[0348] {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 6}, {1 / 3, 11}, {1 / 3, 21}, {1 / 3, 39};

[0349] {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 3}, {1 / 3, 5}, {1 / 3, 10}, {1 / 3, 20}, {1 / 3, 39};

[0350] {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 6}, {1 / 3, 12}, {1 / 3, 22}, {1 / 3, 40};

[0351] {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 3}, {1 / 3, 5}, {1 / 3, 10}, {1 / 3, 20}, {1 / 3, 40}.

[0352] In some embodiments, n is 4, and the repetition times corresponding to the coding rate equal to 1 / 2 in the parameter list are equal to 1 or 2. In some other embodiments, n is 4, the maximum value of the repetition times corresponding to the coding rate equal to 1 / 2 in the parameter list is equal to 2, and / or the minimum value is equal to 1.

[0353] In some other embodiments, n is 4, and the minimum value of the repetition times corresponding to the coding rate equal to 1 / 3 in the parameter list is equal to 1. In some other embodiments, n is 4, and the number of candidate combinations corresponding to the coding rate equal to 1 / 3 in the parameter list is equal to 13, 14 or 15. In some other embodiments, n is 4, and the maximum value of the repetition times corresponding to the coding rate equal to 1 / 3 in the parameter list is equal to 5, 6, 7, 8, 9, 10, 12, 16, 20, 24, 28, 32, 36 or 40.

[0354] In some other embodiments, n is 4, and for any two adjacent repetition times in the candidate combinations corresponding to the coding rate equal to 1 / 3 in the parameter list, the ratio (the value obtained by dividing the larger repetition time by the smaller repetition time) is not greater than 1.1, 1.2, 1.5, 1.8, 2, 2.2, 2.5, 3 or 4.

[0355] In some other embodiments, n is 4, and for all ratios (the values obtained by dividing the larger repetition time by the smaller repetition time) of any two adjacent repetition times in the candidate combinations corresponding to the coding rate equal to 1 / 3 in the parameter list, the difference between the maximum ratio and the minimum ratio is not greater than 0.1, 0.2, 0.3, 0.5, 1, 1.5, 2, 3 or 4.

[0356] In some embodiments, n is 4, the number of candidate combinations is equal to 16, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 8}, {1 / 3, 10}, {1 / 3, 13}, {1 / 3, 16}, {1 / 3, 20}, {1 / 3, 25}, {1 / 3, 32}, {1 / 3, 40}.

[0357] In some embodiments, n is 4, the number of candidate combinations is equal to 16, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 8}, {1 / 3, 10}, {1 / 3, 13}, {1 / 3, 16}, {1 / 3, 20}, {1 / 3, 25}, {1 / 3, 32}, {1 / 3, 40}.

[0358] In some embodiments, n is 4, the number of candidate combinations is equal to 16, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 8}, {1 / 3, 9}, {1 / 3, 10}, {1 / 3, 11}, {1 / 3, 12}, {1 / 3, 13}, {1 / 3, 14}, {1 / 3, 16}.

[0359] In some embodiments, n is 4, the number of candidate combinations is equal to 16, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 8}, {1 / 3, 9}, {1 / 3, 10}, {1 / 3, 11}, {1 / 3, 12}, {1 / 3, 15}, {1 / 3, 19}, {1 / 3, 24}.

[0360] In some embodiments, n is 4, the number of candidate combinations is equal to 16, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 8}, {1 / 3, 9}, {1 / 3, 10}, {1 / 3, 12}, {1 / 3, 15}, {1 / 3, 20}, {1 / 3, 25}, {1 / 3, 32}.

[0361] In some embodiments, n is 4, the number of candidate combinations is equal to 16, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 8}, {1 / 3, 10}, {1 / 3, 14}, {1 / 3, 18}, {1 / 3, 24}, {1 / 3, 32}.

[0362] In some embodiments, n is 4, the number of candidate combinations is equal to 16, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 8}, {1 / 3, 9}, {1 / 3, 10}, {1 / 3, 13}, {1 / 3, 17}, {1 / 3, 22}, {1 / 3, 28}, {1 / 3, 36}.

[0363] In some embodiments, n is 4, the number of candidate combinations is equal to 16, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 8}, {1 / 3, 11}, {1 / 3, 15}, {1 / 3, 20}, {1 / 3, 27}, {1 / 3, 36}.

[0364] In some embodiments, n is 4, and the parameter list is one of the following:

[0365] {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 8}, {1 / 3, 10}, {1 / 3, 13}, {1 / 3, 16}, {1 / 3, 20}, {1 / 3, 25}, {1 / 3, 32}, {1 / 3, 40};

[0366] {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 8}, {1 / 3, 10}, {1 / 3, 13}, {1 / 3, 16}, {1 / 3, 20}, {1 / 3, 25}, {1 / 3, 32}, {1 / 3, 40}.

[0367] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、13}；

[0368] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、14}；

[0369] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、13}，{1 / 3、14}，{1 / 3、15}；

[0370] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、15}；

[0371] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、13}，{1 / 3、14}，{1 / 3、16}；

[0372] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、13}，{1 / 3、16}；

[0373] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、13}，{1 / 3、14}，{1 / 3、17}；

[0374] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、13}，{1 / 3、17}；

[0375] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、13}，{1 / 3、15}，{1 / 3、18}；

[0376] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、14}，{1 / 3、18}；

[0377] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、13}，{1 / 3、16}，{1 / 3、19}；

[0378] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、12}，{1 / 3、15}，{1 / 3、19}；

[0379] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、13}，{1 / 3、16}，{1 / 3、20}；

[0380] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、12}，{1 / 3、16}，{1 / 3、20}；

[0381] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、14}，{1 / 3、17}，{1 / 3、21}；

[0382] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、13}，{1 / 3、16}，{1 / 3、21}；

[0383] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、14}，{1 / 3、18}，{1 / 3、22}；

[0384] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、13}，{1 / 3、17}，{1 / 3、22}；

[0385] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、15}，{1 / 3、18}，{1 / 3、23}；

[0386] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、11}，{1 / 3、14}，{1 / 3、18}，{1 / 3、23}；

[0387] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、15}，{1 / 3、19}，{1 / 3、24}；

[0388] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、11}，{1 / 3、14}，{1 / 3、18}，{1 / 3、24}；

[0389] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、13}，{1 / 3、16}，{1 / 3、20}，{1 / 3、25}；

[0390] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、11}，{1 / 3、15}，{1 / 3、19}，{1 / 3、25}；

[0391] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、13}，{1 / 3、16}，{1 / 3、21}，{1 / 3、26}；

[0392] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、12}，{1 / 3、15}，{1 / 3、20}，{1 / 3、26}；

[0393] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、13}，{1 / 3、17}，{1 / 3、21}，{1 / 3、27}；

[0394] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、12}，{1 / 3、16}，{1 / 3、21}，{1 / 3、27}；

[0395] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、14}，{1 / 3、17}，{1 / 3、22}，{1 / 3、28}；

[0396] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、12}，{1 / 3、16}，{1 / 3、21}，{1 / 3、28}；

[0397] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、14}，{1 / 3、18}，{1 / 3、23}，{1 / 3、29}；

[0398] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、10}，{1 / 3、13}，{1 / 3、17}，{1 / 3、22}，{1 / 3、29}；

[0399] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、15}，{1 / 3、18}，{1 / 3、24}，{1 / 3、30}；

[0400] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、10}，{1 / 3、13}，{1 / 3、17}，{1 / 3、23}，{1 / 3、30}；

[0401] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、12}，{1 / 3、15}，{1 / 3、19}，{1 / 3、24}，{1 / 3、31}；

[0402] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、10}，{1 / 3、13}，{1 / 3、18}，{1 / 3、23}，{1 / 3、31}；

[0403] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、12}，{1 / 3、15}，{1 / 3、20}，{1 / 3、25}，{1 / 3、32}；

[0404] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、10}，{1 / 3、14}，{1 / 3、18}，{1 / 3、24}，{1 / 3、32}；

[0405] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、12}，{1 / 3、16}，{1 / 3、20}，{1 / 3、26}，{1 / 3、33}；

[0406] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、11}，{1 / 3、14}，{1 / 3、19}，{1 / 3、25}，{1 / 3、33}；

[0407] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、12}，{1 / 3、16}，{1 / 3、21}，{1 / 3、26}，{1 / 3、34}；

[0408] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、11}，{1 / 3、14}，{1 / 3、19}，{1 / 3、25}，{1 / 3、34}；

[0409] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、13}，{1 / 3、16}，{1 / 3、21}，{1 / 3、27}，{1 / 3、35}；

[0410] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、11}，{1 / 3、15}，{1 / 3、20}，{1 / 3、26}，{1 / 3、35}；

[0411] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、13}，{1 / 3、17}，{1 / 3、22}，{1 / 3、28}，{1 / 3、36}；

[0412] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、11}，{1 / 3、15}，{1 / 3、20}，{1 / 3、27}，{1 / 3、36}；

[0413] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、13}，{1 / 3、17}，{1 / 3、22}，{1 / 3、29}，{1 / 3、37}；

[0414] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、9}，{1 / 3、12}，{1 / 3、16}，{1 / 3、21}，{1 / 3、28}，{1 / 3、37}；

[0415] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、13}，{1 / 3、17}，{1 / 3、22}，{1 / 3、29}，{1 / 3、38}；

[0416] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、9}，{1 / 3、12}，{1 / 3、16}，{1 / 3、21}，{1 / 3、28}，{1 / 3、38}；

[0417] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、11}，{1 / 3、14}，{1 / 3、18}，{1 / 3、23}，{1 / 3、30}，{1 / 3、39}；

[0418] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、9}，{1 / 3、12}，{1 / 3、16}，{1 / 3、22}，{1 / 3、29}，{1 / 3、39}；

[0419] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、11}，{1 / 3、14}，{1 / 3、18}，{1 / 3、24}，{1 / 3、31}，{1 / 3、40}；

[0420] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、9}，{1 / 3、12}，{1 / 3、16}，{1 / 3、22}，{1 / 3、30}，{1 / 3、40}。

[0421] In some embodiments, a combination including an encoding code rate and a repetition count is determined according to control information, and all the combinations form a parameter list: {1, 1}, {R, 1}, {1 / 3, 1}, {1 / 3, E}, where R is a real number greater than 1 / 3 and less than 1, and E is an integer greater than 1 and less than or equal to 64.

[0422] In a specific example, the R is equal to 2 / 3, 3 / 4, 4 / 5, 3 / 5, 2 / 5, 5 / 6, 6 / 7, 5 / 7, 4 / 7, 3 / 7, 7 / 8, 5 / 8, 3 / 8, 8 / 9, 7 / 9, 5 / 9, 4 / 9, 9 / 10, 7 / 10, 4 / 10 or 1 / 2. In one example, R is equal to 2 / 3. In one example, R is equal to 3 / 4. In one example, R is equal to 4 / 5. In one example, R is equal to 5 / 6. In one example, R is equal to 5 / 8. In one example, R is equal to 1 / 2. In one example, R is equal to 3 / 5. In one example, R is equal to 5 / 8.

[0423] In a specific example, the E is equal to 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 22, 24, 32, 36, 40, 48, 56 or 64. In one example, E is equal to 2. In one example, E is equal to 4. In one example, E is equal to 6. In one example, E is equal to 8.

[0424] In some embodiments, a combination including an encoding code rate and a repetition count is determined according to control information, and all the combinations form a parameter list: {1, 1}, {R0, 1}, {R1, 1}, {1 / 3, 1}, {1 / 3, E0}, {1 / 3, E1}, {1 / 3, E2}, {1 / 3, E3}, where R0 and R1 are both real numbers greater than 1 / 3 and less than 1, and E0, E1, E2, and E3 are integers greater than 1 and less than or equal to 64 respectively. In a specific example, the R0 and R1 are respectively equal to 2 / 3, 3 / 4, 4 / 5, 3 / 5, 2 / 5, 5 / 6, 6 / 7, 5 / 7, 4 / 7, 3 / 7, 7 / 8, 5 / 8, 3 / 8, 8 / 9, 7 / 9, 5 / 9, 4 / 9, 9 / 10, 7 / 10, 4 / 10 or 1 / 2. In another specific example, the E0, E1, E2, and E3 are respectively equal to 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 22, 24, 32, 36, 40, 48, 56 or 64.

[0425] In one example, R0 equals 2 / 3, R1 equals 1 / 2; E0 equals 2, E1 equals 3, E2 equals 4, E3 equals 5. In one example, R0 equals 2 / 3, R1 equals 1 / 2; E0 equals 2, E1 equals 4, E2 equals 6, E3 equals 8. In one example, R0 equals 3 / 4, R1 equals 1 / 2; E0 equals 2, E1 equals 4, E2 equals 8, E3 equals 16. In one example, R0 equals 4 / 5, R1 equals 1 / 2; E0 equals 2, E1 equals 4, E2 equals 8, E3 equals 32.

[0426] In some embodiments, the number of bits in the bit sequence corresponding to the control information for indicating the combination of the coding rate and the number of repetitions is determined based on high-layer control signaling.

[0427] In some embodiments, the minimum value of the number of bits in the bit sequence corresponding to the control information for indicating the combination of the coding rate and the number of repetitions is one of the following: 1, 2, 3.

[0428] In some embodiments, the maximum value of the number of bits in the bit sequence corresponding to the control information for indicating the combination of the coding rate and the number of repetitions is one of the following: 3, 4, 5.

[0429] In some embodiments, a first sequence is generated based on the information bit sequence, and the coding rate and / or the number of repetitions, including: performing convolutional coding on the information bit sequence based on the coding rate to obtain a coded bit sequence; performing a repetition process on the coded bit sequence based on the number of repetitions to obtain the first sequence.

[0430] In some embodiments, the coding rate is less than 1.

[0431] In some embodiments, the number of repetitions is greater than 1.

[0432] It should be noted that if the coding rate equals 1, it means that the number of bits in the coded bit sequence output by convolutional coding is equal to the number of bits in the input information bit sequence. In this case, no convolutional coding is required, that is, convolutional coding is skipped, and the coded bit sequence is directly equal to the input information bit sequence. And if the number of repetitions equals 1, it means that no repetition operation is required, and the first sequence is directly equal to the coded bit sequence.

[0433] In some embodiments, the convolutional coding includes three generating polynomials represented in octal: 133, 171, and 165.

[0434] In some embodiments, the control information is further used to determine the number of bits in the information bit sequence.

[0435] In some embodiments, the number of bits in the information bit sequence is determined by the following method:

[0436] Determine the number of bits of the information bit sequence from a first list (or referred to as a transport block size (TBS) list) based on control information; the first list includes at least one transport block size. The transport block size can also be referred to as the payload size, or can also be referred to as the number of information bits or the message size. At least one transport block size in the first list is a positive integer. This first list can be called a transport block size list or a payload size list or a message size list or a number of information bits list.

[0437] In some embodiments, the number of transport block sizes in the first list is one of the following: 8, 16, 32, 64, 128, 256. The number of transport block sizes in the first list is equal to a positive integer power of 2, which is convenient for mapping using control information.

[0438] In some embodiments, the largest transport block size in the first list is one of the following: 800, 960, 992, 1000, 1024, 1080, 1200, 1536, 2000, 2048. In one example, the largest transport block size in the first list is equal to 1000. In one example, the largest transport block size in the first list is equal to 1024. In one example, the largest transport block size in the first list is equal to 992. In one example, the largest transport block size in the first list is equal to 2048. In one example, the largest transport block size in the first list is equal to 1200.

[0439] In some embodiments, the smallest transport block size in the first list is one of the following: 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 24, 32. In one example, the smallest transport block size in the first list is equal to 8. In one example, the smallest transport block size in the first list is equal to 16. In one example, the smallest transport block size in the first list is equal to 6. In one example, the smallest transport block size in the first list is equal to 12. In one example, the smallest transport block size in the first list is equal to 10. In one example, the smallest transport block size in the first list is equal to 9.

[0440] In some embodiments, the minimum value of the differences between adjacent transport block sizes in the first list is one of the following: 4, 6, 8, 10, 12, 16, 24, 32. In one example, the minimum value of the differences between adjacent transport block sizes in the first list is equal to 8. In one example, the minimum value of the differences between adjacent transport block sizes in the first list is equal to 4.

[0441] In some embodiments, the difference between adjacent transport block sizes in the first list is an integer multiple of at least one of the following values: 4, 6, 8, 10, 12, 16, 24, 32.

[0442] In some embodiments, the maximum value of the differences between adjacent transport block sizes in the first list is one of the following: 16, 24, 32, 48, 64, 80, 96, 128, 256, 512. In one example, the maximum value of the differences between adjacent transport block sizes in the first list is equal to 32. In one example, the maximum value of the differences between adjacent transport block sizes in the first list is equal to 48. In one example, the maximum value of the differences between adjacent transport block sizes in the first list is equal to 64. In one example, the maximum value of the differences between adjacent transport block sizes in the first list is equal to 128.

[0443] In some embodiments, the first list includes transport block sizes of at least one of the following: 8, 16, 20, 24, 32, 56, 64, 88, 96, 104, 128, 256, 400, 512, 1000, 1024.

[0444] In some embodiments, the first list includes a sequence of positive integers sorted from smallest to largest.

[0445] In some embodiments, in the first list, in the range from K0 to K1, at least H integer values are included, where the difference between any two adjacent integer values in this range is equal, H is an integer greater than 2, and both K0 and K1 are positive integers and K1 is greater than K0. In one example, K0 is equal to one of the following: 4, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 22, 24, 32, 64, 88, 96, 104, 120, 128, 136, 240, 256, 272, 392, 400, 408, 512, 768. In one example, K1 is equal to one of the following: 64, 88, 96, 104, 120, 128, 136, 240, 256, 272, 392, 400, 408, 512, 768, 960, 1000, 1024, 1080, 1088.

[0446] In a specific example, K0 is equal to 8 and K1 is equal to 96. In another specific example, K0 is equal to 96 and K1 is equal to 400. In another specific example, K0 is equal to 400 and K1 is equal to 1000. In another specific example, K0 is equal to 400 and K1 is equal to 1024. In one example, K0 = 8, K1 = 96, and H is equal to 12, where the difference between two adjacent integer values is equal to 8. In another example, K0 = 96, K1 = 384, and H is equal to 9, where the difference between two adjacent integer values is equal to 32. In another example, K0 = 384, K1 = 1088, and H is equal to 11, where the difference between two adjacent integer values is equal to 64.

[0447] In some embodiments, in the first list, it includes integer values in a first range and integer values in a second range. The integer values in the first range are less than the integer values in the second range. The first difference between any two adjacent integer values in the first range is equal, and the second difference between any two adjacent integer values in the second range is equal. The first difference is less than the second difference. In a specific example, the second difference is equal to C times the first difference, where C is equal to 1.5, 2, 2.5, 3, 3.5, 4, or 5. In a specific example, the integer values in the first range include one or more of the following integers: 6, 8, 10, 12, 14, 16, 18, 20, 24, 32, 40, 88, 96, 104, 112, 128, 200, 240, 256, 272, 384, 400, 408, 512. In a specific example, the integer values in the second range include one or more of the following integers: 96, 104, 112, 128, 200, 240, 256, 272, 384, 400, 408, 512, 768, 888, 960, 1000, 1008, 1024, 1080, 1088.

[0448] In some embodiments, in the first list, it includes integer values in a first range, integer values in a second range, and integer values in a third range. The integer values in the first range are less than the integer values in the second range, the integer values in the second range are less than the integer values in the third range. The first difference between any adjacent integer values in the first range is equal, the second difference between any adjacent integer values in the second range is equal, the third difference between any adjacent integer values in the third range is equal. The first difference is less than the second difference, and the second difference is less than the third difference. In a specific example, the second difference is equal to C1 times the first difference, where C1 is equal to 1.5, 2, 2.5, 3, 3.5, 4, or 5. In a specific example, the third difference is equal to C2 times the second difference, where C2 is equal to 1.5, 2, 2.5, 3, 3.5, 4, or 5. In a specific example, the integer values in the first range include one or more of the following integers: 6, 8, 10, 12, 14, 16, 18, 20, 24, 32, 40, 48, 64, 72, 88, 96, 104, 112, 128, 136, 144, 152, 160, 176, 200, 256. In a specific example, the integer values in the second range include one or more of the following integers: 96, 104, 112, 128, 136, 144, 152, 160, 176, 200, 208, 216, 240, 248, 256, 264, 272, 288, 296, 304, 320, 384, 400, 408, 440, 472, 488, 496, 504, 512, 528, 560, 600, 768. In a specific example, the integer values in the third range include one or more of the following integers: 400, 408, 512, 600, 736, 768, 800, 840, 888, 960, 992, 1000, 1008, 1024, 1056, 1080, 1088.

[0449] In some embodiments, in the first list, it includes integer values in a first range, integer values in a second range, integer values in a third range, and integer values in a fourth range. The integer values in the first range are less than the integer values in the second range, the integer values in the second range are less than the integer values in the third range, the integer values in the second range are less than the integer values in the fourth range. The first difference between any adjacent integer values in the first range is equal, the second difference between any adjacent integer values in the second range is equal, the third difference between any adjacent integer values in the third range is equal, the fourth difference between any adjacent integer values in the fourth range is equal. The first difference is less than the second difference, the second difference is less than the third difference, and the third difference is less than the fourth difference. In a specific example, the second difference is equal to C1 times the first difference, where C1 is equal to 1.5, 2, 2.5, 3, 3.5, 4, or 5. In a specific example, the third difference is equal to C2 times the second difference, where C2 is equal to 1.5, 2, 2.5, 3, 3.5, 4, or 5. In a specific example, the fourth difference is equal to C3 times the third difference, where C3 is equal to 1.5, 2, 2.5, 3, 3.5, 4, or 5. In a specific example, the integer values in the first range include one or more of the following integers: 6, 8, 10, 12, 14, 16, 18, 20, 24, 32, 40, 48, 64, 72, 88, 96. In a specific example, the integer values in the second range include one or more of the following integers: 72, 88, 96, 104, 112, 128, 136, 144, 152, 160, 176, 200, 208, 216, 240, 248, 256, 264, 272, 288, 296, 304, 320, 384, 400, 408, 440, 472, 488. In a specific example, the integer values in the third range include one or more of the following integers: 256, 264, 272, 288, 296, 304, 320, 384, 400, 408, 440, 472, 488, 496, 504, 512, 528, 560, 600, 768. In a specific example, the integer values in the fourth range include one or more of the following integers: 400, 408, 512, 600, 736, 768, 800, 840, 888, 960, 992, 1000, 1008, 1024, 1056, 1080, 1088.

[0450] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 8, 20, 32, 64, 96, 256, 400, 1000.

[0451] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 20, 32, 64, 96, 256, 400, 768, 1000.

[0452] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 16, 32, 64, 96, 256, 400, 768, 1000.

[0453] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 12, 32, 64, 96, 256, 400, 768, 1000.

[0454] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 16, 32, 64, 96, 248, 400, 1024.

[0455] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 20, 32, 48, 64, 80, 96, 128, 192, 256, 320, 400, 528, 656, 784, 912, 1000.

[0456] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 16, 32, 48, 64, 80, 96, 192, 288, 400, 608, 816, 1024.

[0457] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 16, 32, 48, 64, 80, 96, 192, 288, 400, 560, 720, 880, 1024.

[0458] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 16, 24, 32, 48, 64, 80, 96, 192, 288, 400, 560, 720, 880, 1024.

[0459] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 16, 24, 32, 40, 48, 64, 80, 96, 192, 288, 400, 608, 816, 1024.

[0460] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 8, 16, 32, 48, 64, 80, 96, 144, 192, 240, 288, 400, 608, 816, 1024.

[0461] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 10, 42, 74, 106, 256, 512, 768, 1024.

[0462] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 8, 40, 72, 104, 256, 512, 768, 1024.

[0463] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 16, 48, 80, 112, 256, 512, 768, 1024.

[0464] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 16, 80, 144, 208, 256, 512, 768, 1024.

[0465] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 16, 80, 144, 208, 232, 488, 744, 1000.

[0466] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 8, 72, 136, 200, 232, 488, 744, 1000.

[0467] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 4, 68, 132, 196, 232, 488, 744, 1000.

[0468] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 8, 136, 264, 392, 512, 656, 800, 944.

[0469] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 10, 138, 266, 394, 512, 664, 816, 968.

[0470] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 16, 144, 272, 400, 512, 672, 832, 992.

[0471] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 136, 264, 392, 512, 680, 848, 1016.

[0472] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 150, 274, 398, 522, 646, 770, 1000.

[0473] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 16, 160, 304, 448, 592, 736, 880, 1000.

[0474] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 12, 156, 300, 444, 588, 732, 876, 1000.

[0475] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 43, 78, 113, 148, 183, 218, 253, 349, 442, 535, 628, 721, 814, 907, 1000.

[0476] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 40, 72, 104, 136, 168, 200, 232, 352, 448, 544, 640, 736, 832, 928, 1024.

[0477] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 40, 72, 104, 136, 168, 200, 232, 352, 448, 544, 640, 736, 832, 928, 1000.

[0478] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 32, 56, 80, 104, 128, 216, 304, 392, 480, 568, 656, 744, 832, 920, 1008.

[0479] In some embodiments, all elements in the first list are equal to all of the following values or are values at a target percentage: 8, 32, 56, 80, 104, 128, 216, 304, 392, 480, 568, 656, 744, 832, 920, 1000.

[0480] In some embodiments, all elements in the first list are equal to all of the following values or are values at a target percentage: 8, 24, 40, 56, 72, 88, 184, 272, 360, 448, 536, 624, 712, 800, 888, 976.

[0481] In some embodiments, all elements in the first list are equal to all of the following values or are values at a target percentage: 8, 24, 40, 56, 72, 88, 184, 272, 360, 448, 536, 624, 712, 800, 888, 1000.

[0482] In some embodiments, all elements in the first list are equal to all of the following values or are values at a target percentage: 8, 48, 88, 128, 168, 208, 248, 288, 328, 368, 504, 608, 712, 816, 920, 1024.

[0483] In some embodiments, all elements in the first list are equal to all of the following values or are values at a target percentage: 8, 40, 72, 104, 136, 168, 200, 232, 264, 296, 420, 540, 660, 780, 900, 1000.

[0484] In some embodiments, all elements in the first list are equal to all of the following values or are values at a target percentage: 8, 40, 72, 104, 136, 168, 200, 288, 376, 464, 552, 640, 728, 816, 904, 992.

[0485] In some embodiments, all elements in the first list are equal to all of the following values or are values at a target percentage: 16, 48, 80, 112, 144, 176, 280, 360, 440, 520, 600, 680, 760, 840, 920, 1000.

[0486] In some embodiments, all elements in the first list are equal to all of the following values or are values at a target percentage: 8, 24, 40, 56, 72, 88, 136, 200, 264, 328, 392, 520, 640, 760, 880, 1000.

[0487] In some embodiments, all elements in the first list are equal to all of the following values or are values at a target percentage: 8, 24, 40, 56, 72, 88, 96, 160, 224, 288, 352, 504, 608, 712, 816, 920.

[0488] In some embodiments, all elements in the first list are equal to all of the following values or are values at a target percentage: 8, 16, 20, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 144, 176, 208, 240, 272, 304, 336, 368, 400, 432, 512, 640, 768, 896, 1000.

[0489] In some embodiments, all elements in the first list are equal to all of the following values or are values at a target percentage: 8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 128, 160, 192, 224, 256, 288, 320, 352, 384, 456, 512, 568, 624, 680, 736, 792, 848, 904, 960, 1016.

[0490] In some embodiments, all elements in the first list are equal to all of the following values or are values at a target percentage: 8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 128, 160, 192, 224, 256, 288, 320, 352, 384, 440, 496, 552, 608, 664, 720, 776, 832, 888, 944, 1000.

[0491] In some embodiments, all elements in the first list are equal to all of the following values or are values at a target percentage: 8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 144, 176, 208, 240, 272, 304, 336, 368, 400, 440, 496, 552, 608, 664, 720, 776, 832, 888, 944, 1000.

[0492] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 144, 176, 208, 240, 272, 304, 336, 368, 400, 464, 520, 576, 632, 688, 744, 800, 856, 912, 968, 1024.

[0493] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 104, 144, 176, 208, 240, 272, 304, 336, 368, 400, 464, 520, 576, 632, 688, 744, 800, 856, 912, 968, 1024.

[0494] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 12, 20, 28, 36, 44, 52, 60, 68, 76, 84, 92, 100, 144, 176, 208, 240, 272, 304, 336, 368, 400, 464, 520, 576, 632, 688, 744, 800, 856, 912, 968, 1024.

[0495] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 6, 14, 22, 30, 38, 46, 54, 62, 70, 78, 86, 94, 144, 176, 208, 240, 272, 304, 336, 368, 400, 464, 520, 576, 632, 688, 744, 800, 856, 912, 968, 1024.

[0496] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 10, 18, 26, 34, 42, 50, 58, 66, 74, 82, 90, 98, 144, 176, 208, 240, 272, 304, 336, 368, 400, 464, 520, 576, 632, 688, 744, 800, 856, 912, 968, 1024.

[0497] Wherein, the target percentage can be equal to: 60%, 70%, 80%, 90% or 95%.

[0498] In some embodiments, the control information is further used to determine the number of bits of the information bit sequence. In some embodiments, the number of bits of the information bit sequence is determined as follows: the control information includes an n-bit indication, and the number of bits of the information bit sequence is obtained by calculating with the n bits.

[0499] In some embodiments, an integer factor is determined according to the range of the integer indicated by the n-bit indication, and different integer ranges have different integer factors. There are C integer ranges, corresponding to C integer factors. The number of bits of the information bit sequence is determined according to the control information including the n-bit indication, the C integer ranges, and the C integer factors. Wherein, n can be equal to 3, 4, 5, or 6. C can be equal to 2, 3, 4, 5, 6, or 8. Wherein, the number of bits of the information bit sequence is equal to a function of the integer indicated by the n-bit indication and the integer factor, and the integer factor is determined according to the C integer ranges based on the integer indicated by the n-bit indication. When the integer ranges are different, the function of the integer indicated by the n-bit indication and the integer factor is different.

[0500] In an example, n is equal to 4, then the integer indicated by the n-bit indication is 0 to 15. There are 3 integer ranges. When the corresponding integer range is 0 to 5, the integer factor is equal to 16; when the corresponding integer range is 6 to 9, the integer factor is equal to 40; when the corresponding integer range is 10 to 15, the integer factor is equal to 64. The integer indicated by the n-bit indication is A. When A is less than or equal to 5, the number of bits of the information bit sequence is equal to (A + 1) * 16; otherwise, when A is less than or equal to 9, the number of bits of the information bit sequence is equal to (A + 1) * 40; otherwise, the number of bits of the information bit sequence is equal to (A + 1) * 64.

[0501] In an example, n is equal to 4 and C is equal to 3, then the corresponding integer ranges and integer factors are shown in Table 1:

[0502] Table 1

[0503] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 0～4 5～10 11～15 Integer Factor 8 40 64

[0504] In an example, n is equal to 4 and C is equal to 3, then the corresponding integer ranges and integer factors are as shown in Table 2 below:

[0505] Table 2

[0506] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 0～4 5～10 11～15 Integer Factor 8 40 50

[0507] When A belongs to the integer range 0, the number of bits of the information bit sequence is equal to the function of the integer indicated by the n-bit indication and the integer factor, which is (A + 1) * 8; when A belongs to the integer range 1, the number of bits of the information bit sequence is equal to the function of the integer indicated by the n-bit indication and the integer factor, which is (A + 1) * 40; when A belongs to the integer range 2, the number of bits of the information bit sequence is equal to the function of the integer indicated by the n-bit indication and the integer factor, which is (A + 5) * 50.

[0508] In some embodiments, the integer factors for all integer ranges are equal to positive integer powers of 2. For example, the integer factor is equal to at least one of the following: 8, 16, 32, 64, 128, 256. The advantage of the integer factor being a positive integer power of 2 is that only by shifting the integer A indicated by the n-bit indication can the number of bits of the information bit sequence be determined, without multiplication operations, the circuit is simple, resources are saved, the calculation amount is small, and the power consumption is very low. In one example, n is equal to 4 and C is equal to 3, then the corresponding integer ranges and integer factors are as shown in Table 3 below:

[0509] Table 3

[0510] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 0～4 5～10 11～15 Integer Factor 8 32 64

[0511] In one example, n is equal to 4 and C is equal to 3, then the number of bits of the information bit sequence is determined as shown in Table 4 below, where A is the integer indicated by the n-bit indication in the control information.

[0512] Table 4

[0513] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 0～4 5～10 11～15 Integer Factor (A+1)*8 (A+1)*32 (A+1)*64

[0514] In one example, n is equal to 4 and C is equal to 4, then the number of bits of the information bit sequence is determined as shown in Table 5 below, where A is the integer indicated by the n-bit indication in the control information.

[0515] Table 5

[0516]

[0517]

[0518] In one example, n is equal to 4 and C is equal to 4, then the number of bits of the information bit sequence is determined as shown in Table 6 below, where A is the integer indicated by the n-bit indication in the control information.

[0519] Table 6

[0520] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 3 Integer Range 0～5 6～8 9～11 12～15 Integer Factor (A+1)*8 (A+1)*16 (A+1)*32 (A+1)*64

[0521] In one example, n equals 4 and C equals 4, then the number of bits of the information bit sequence is determined as shown in Table 7 below, where A is the integer indicated by the n-bit indication in the control information.

[0522] Table 7

[0523] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 3 Integer Range 0～5 6～8 9～11 12～15 Integer Factor (A+1)*8 (A+1)*16 (A+1)*32 (A+5)*50

[0524] In one example, n equals 5 and C equals 3, then the number of bits of the information bit sequence is determined as shown in Table 8 below, where A is the integer indicated by the n-bit indication in the control information.

[0525] Table 8

[0526] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 0～10 11～21 22～31 Integer Factor (A+1)*8 (A+1)*16 (A+1)*32

[0527] In one example, n equals 5 and C equals 4, then the number of bits of the information bit sequence is determined as shown in Table 9 below, where A is the integer indicated by the n-bit indication in the control information.

[0528] Table 9

[0529] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 3 Integer Range 0～7 8～15 16～23 24～31 Integer Factor (A+1)*4 (A+1)*8 (A+1)*16 (A+1)*32

[0530] In one example, n equals 5 and C equals 4, then the number of bits of the information bit sequence is determined as shown in Table 10 below, where A is the integer indicated by the n-bit indication in the control information.

[0531] Table 10

[0532] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 3 Integer Range 0～7 8～15 16～23 24～31 Integer Factor (A+1)*8 (A+1)*12 (A+1)*16 (A+1)*32

[0533] In one example, n equals 5 and C equals 2, then the number of bits of the information bit sequence is determined as shown in Table 11 below, where A is the integer indicated by the n-bit indication in the control information.

[0534] Table 11

[0535] Integer Range 0 Integer Range 1 Integer Range 0～15 16～31 Integer Factor (A+1)*8 (A+1)*32

[0536] In one example, n equals 5 and C equals 2, then the number of bits of the information bit sequence is determined as shown in Table 12 below, where A is the integer indicated by the n-bit indication in the control information.

[0537] Table 12

[0538] Integer Range 0 Integer Range 1 Integer Range 0～23 24～31 Integer Factor (A+1)*8 (A+1)*32

[0539] In one example, n equals 5 and C equals 2, then the number of bits of the information bit sequence is determined as shown in Table 13 below, where A is the integer indicated by the n-bit indication in the control information.

[0540] Table 13

[0541] Integer Range 0 Integer Range 1 Integer Range 0～11 12～31 Integer Factor (A+1)*8 (A+1)*32

[0542] In one example, n equals 6 and C equals 3. Then, the number of bits of the information bit sequence is determined as shown in Table 14 below, where A is the integer indicated by the n-bit indication in the control information.

[0543] Table 14

[0544] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 0～20 21～43 22～63 Integer Factor (A+1)*8 (A+1)*12 (A+1)*16

[0545] In one example, n equals 6 and C equals 2. Then, the number of bits of the information bit sequence is determined as shown in Table 15 below, where A is the integer indicated by the n-bit indication in the control information.

[0546] Table 15

[0547] Integer Range 0 Integer Range 1 Integer Range 0～31 32～63 Integer Factor (A+1)*8 (A+1)*16

[0548] In some embodiments, the control information includes at least one of the following: transport block size index, frequency shift factor, number of chips within an orthogonal frequency division multiplexing (OFDM) symbol, chip duration, bit duration, number of repetitions, coding code rate, coding repetition strategy index. The transport block size index is used to determine a transport block size in a first list, that is, corresponding to the number of bits of the information bit sequence. The frequency shift factor is used to indicate the amount of frequency offset for data transmission. The larger the frequency shift factor, the larger the offset amount. Different user equipments adopt different frequency shift factors, which can minimize the spectrum aliasing between them. The number of chips within an OFDM symbol refers to the number of levels included in one transmitted OFDM symbol. The chip duration is the duration of one level. The bit duration is the transmission duration of an information bit or an encoded bit.

[0549] In some embodiments, the first list is one of the following or one of the following for a target percentage: 1) 8, 16, 32, 64, 128, 256, 512, 1024; 2) 8, 20, 32, 64, 96, 256, 400, 1000; 3) 8, 16, 24, 32, 48, 64, 80, 96, 160, 224, 288, 352, 480, 608, 736, 864; 4) 20, 32, 48, 64, 80, 96, 128, 192, 256, 320, 400, 528, 656, 784, 912, 1000; 5) 20, 32, 48, 64, 80, 96, 128, 192, 256, 320, 400, 528, 656, 784, 912, 1024; 6) 20, 28, 40, 56, 72, 96, 128, 176, 232, 296, 400, 480, 576, 704, 832, 1000; 7) 8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 160, 192, 224, 256, 320, 384, 448, 512, 576, 640, 704, 768, 832, 896, 960, 1024; 8) 8, 16, 20, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 144, 176, 208, 240, 272, 304, 336, 368, 400, 432, 512, 640, 768, 896, 1000;

[0558] 9) 8, 16, 20, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 144, 176, 208, 240, 272, 304, 336, 368, 400, 432, 512, 640, 768, 896, 1024.

[0559] Among them, the target percentage can be: 60%, 70%, 80%, 90% or 95%.

[0560] The following is an example of the communication method provided by this public example:

[0561] Example 1:

[0562] Assume n is 2. As shown in Table 16, it is an example of the combination of the coding rate and the number of repetitions corresponding to different coding repetition strategies indexes provided by this public embodiment, including 4 combinations containing the coding rate and the number of repetitions, and the coding repetition strategy index (Index) is 0 to 3:

[0563] Table 16

[0564] Index Code Rate Rep 0 1 1 1 1 / 2 1 2 1 / 3 2 3 1 / 3 6

[0565] Among them, if 2 bits in the control information are used to indicate an index value of 0, then these 2 bits are '00', the coding rate is 1 and the number of repetitions is 1. If the index value indicated by 2 bits is 1, then these 2 bits are '01', the coding rate is 1 / 2 and the number of repetitions is 1. If the index value indicated by 2 bits is 2, then these 2 bits are '10', the coding rate is 1 / 3 and the number of repetitions is 2. If the index value indicated by 2 bits is 3, then these 2 bits are '11', the coding rate is 1 / 3 and the number of repetitions is 6.

[0566] In one implementation, when the mother code rate of convolutional coding is 1 / 3, there are three generating polynomials represented in octal: 133, 171, and 165. These three polynomials can be expressed as:

[0567] G0(D) = 1 + D 2 + D 3 + D 5 + D 6 ;

[0568] G1(D) = 1 + D 1 + D 2 + D 3 + D 6 ;

[0569] G2(D) = 1 + D 1 + D 2 + D 4 + D 6 .

[0570] Exemplarily, assuming the information bit sequence is c, c1, c2, c3, …, c K-1 , the hardware implementation of convolutional coding is as shown in Figure 2 , where in the example, it is the k-th bit ck of the input information bit sequence. After encoding, 3 bits are output + . The number of shift registers passed through, that is, the number of clock beats corresponding to the delay, can be determined based on the power of "D" in the polynomial. For the 0th component code, its corresponding generating polynomial is G0(D) = 1 + D

[0571] + D 2 + D 3 + D 5 + D 6 , which means that the output bit of the component code corresponding to this generating polynomial is the result of the exclusive OR of the non-delayed bit (1 information bit), the output of the 2nd shift register (after passing through 2 delay elements), the output of the 3rd shift register (after passing through 3 delay elements), the output of the 5th shift register (after passing through 5 delay elements), and the output of the 6th shift register (after passing through 6 delay elements). That is, the input is the k-th bit of the information bit sequence, and the output bit of the 0th component code is

[0572] For the 1st component code, its polynomial is G1(D) = 1 + D 1 + D 2+ D 3 + D 6, indicating that the output bit of the component code corresponding to this generating polynomial is the result of the exclusive OR of the non-delayed bit (1 information bit), the output of the first shift register (after 1 delay element), the output of the second shift register (after 2 delay elements), the output of the third shift register (after 3 delay elements), and the output of the sixth shift register (after 6 delay elements), that is, the input is the k-th bit of the information bit sequence, and the output bit of the first component code is

[0573] For the second component code, the corresponding polynomial is G2(D) = 1 + D 1 + D 2 + D 4 + D 6 indicating that the output bit of the component code corresponding to this generating polynomial is the result of the exclusive OR of the non-delayed bit (1 information bit), the output of the first shift register (after 1 delay element), the output of the second shift register (after 2 delay elements), the output of the fourth shift register (after 4 delay elements), and the output of the sixth shift register (after 6 delay elements), that is, the input is the k-th bit of the information bit sequence, and the output bit of the first component code is The output bits of 3 component codes constitute the coded bit subsequence.

[0574] In some embodiments, the to-be-transmitted coded bit subsequence can be determined from this coded bit subsequence according to the coding rate. Exemplarily, if the coding rate R is equal to 1 / 3, then the 0th to 2nd bits are selected from this coded bit subsequence to form the coding output sequence corresponding to the k-th bit of the information bit sequence At this time, for the information bit sequence with the number of input bits equal to K, the coded bit sequence obtained after convolutional coding is e = e0, e1, e2,..., e N-1 , where N is the number of bits in the coded bit sequence, N is equal to K / R = 3K. Exemplarily, if the coding rate R is equal to 1 / 2, then the 0th to 1st bits are selected from the coded bit subsequence obtained based on this coding rate to form this to-be-transmitted coded bit subsequence At this time, the number of bits in the coded bit sequence is N = K / R = 2K, and the coded bit sequence is

[0575] In some embodiments, this convolutional coding first encodes the 0th component code to obtain the 0th component code bit sequence Then encodes the 1st component code to obtain the 1st component code bit sequence And encodes the 2nd component code to obtain the 2nd component code bit sequence For a coding rate of 1 / 3, the coded bit sequence is formed by sequentially placing the 3 component code bit sequences, that is, the coded bit sequence is For a coding rate of 1 / 3, the coded bit sequence is formed by sequentially placing the first 2 component code bit sequences, that is, the coded bit sequence is

[0576] In some embodiments, the coded bit sequence is repeated according to the number of repetitions to obtain a first sequence. Exemplarily, the coded bit sequence is e = e0, e1, e2, …, e N-1 , and repeating the coded bit sequence to obtain the first sequence as f = f0, f1, f2, …, f G-1 , where G is the number of bits of the first sequence. For the number of repetitions being Rep, G is equal to Rep * N. In this example, the repetition method is performed at the code block level, that is, the first sequence is f = [e, …, e] 1×Rep = [[e0, …, e N-1 , …, [e0, …, e N-1 1×Rep .

[0577] Exemplarily, if the combination of coding rate and number of repetitions shown in Table 1 is adopted, the length of the information bit sequence is equal to 96, and simulations are performed in an additive white Gaussian noise (AWGN) channel. The code block error rate performance is as Figure 5 shown, where the abscissa is the signal-to-noise ratio and the ordinate is the code block error rate. Based on Figure 5 , it can be seen that when the code block error rate reaches 0.1, the signal-to-noise ratio gap between combinations 1 to 3 of the coding rate and the number of repetitions is 5 dB, which is very uniform, facilitating the network device (or reader) to select an optimal combination scheme for data transmission according to the channel conditions. In some embodiments, if the tag device is far from the reader, in order to ensure the reliability of data transmission, a combination with a lower coding rate and a larger number of repetitions can be selected to ensure correct data transmission; if the tag device is close to the reader, a combination with a higher coding rate and a smaller number of repetitions can be adopted to save overhead and system load, increase the system communication capacity, and improve the robustness of the communication system.

[0578] It should be noted that the combination 0 of the coding rate and the number of repetitions corresponds to a coding rate of 1 and a number of repetitions of 1. At this time, although there are no redundant bits, that is, there is no error correction ability, since the data transmission efficiency under this combination is equal to 1, the data transmission rate can be increased under good channel conditions. For example, in the area where the user equipment (or tag device) is close to the network device (reader), this combination can be used to obtain the maximum transmission rate.​

[0579] Suppose the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}. As shown in Table 17, it is an example of the combination of coding code rate and repetition times corresponding to another different coding repetition strategy index provided by this public example, and the coding repetition strategy index is 0 to 3.

[0580] Table 17

[0581] Index Code Rate Rep 0 1 1 1 1 / 3 1 2 1 / 3 2 3 1 / 3 4

[0582] Among them, if the index value indicated by the control information is 0, the coding code rate is 1 and the repetition times is 1. If the index value indicated by the control information is 1, the coding code rate is 1 / 3 and the repetition times is 1. If the index value indicated by the control information is 2, the coding code rate is 1 / 3 and the repetition times is 2. If the index value indicated by the control information is 3, the coding code rate is 1 / 3 and the repetition times is 4. Adopting the combination of coding code rate and repetition times shown in Table 2, the length of the information bit sequence is equal to 96, and simulation is carried out in the AWGN channel. The code block error rate performance is as Figure 6 shown. Based on Figure 6 , it can be seen that when the code block error rate reaches 0.1, the signal-to-noise ratio gap between combinations 1 to 3 of the coding code rate and repetition times is 3 dB, which is very uniform.

[0583] Suppose the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 4}, {1 / 3, 16}. As shown in Table 18, it is an example of the combination of coding code rate and repetition times corresponding to another different coding repetition strategy index provided by this public example, and the coding repetition strategy index is 0 to 3:

[0584] Table 18

[0585] Index Code Rate Rep 0 1 1 1 1 / 3 1 2 1 / 3 4 3 1 / 3 16

[0586] Adopting the combination of coding code rate and repetition times shown in Table 3, the length of the information bit sequence is equal to 96, and simulation is carried out in the AWGN channel. The code block error rate performance is as Figure 7 shown. It can be seen that when the code block error rate reaches 0.1, the signal-to-noise ratio gap between combinations 1 to 3 of the coding code rate and repetition times is 6 dB.

[0587] Suppose the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 24}. As shown in Table 19, it is an example of the combination of coding code rate and repetition times corresponding to another different coding repetition strategy index provided by this public example, and the coding repetition strategy index is 0 to 3.

[0588] Table 19

[0589] Index Code Rate Rep 0 1 1 1 1 / 2 1 2 1 / 3 4 3 1 / 3 24

[0590] Using the combination of coding code rate and number of repetitions shown in Table 4, the length of the information bit sequence is equal to 96, and simulation is carried out in the AWGN channel. The code block error rate performance is as Figure 8 shown. It can be seen that when the code block error rate reaches 0.1, the signal-to-noise ratio gap between combinations 1 to 3 of the coding code rate and the number of repetitions is 8 dB.

[0591] Assume the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 25}. Table 20 shows another example of the combination of coding code rate and number of repetitions corresponding to different coding repetition strategy indexes provided by this public example. The coding repetition strategy index is 0 to 3.

[0592] Table 20

[0593] Index Code Rate Rep 0 1 1 1 1 / 2 1 2 1 / 3 4 3 1 / 3 25

[0594] Assume the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 23}. Table 21 shows another example of the combination of coding code rate and number of repetitions corresponding to different coding repetition strategy indexes provided by this public example. The coding repetition strategy index is 0 to 3.

[0595] Table 21

[0596] Index Code Rate Rep 0 1 1 1 1 / 2 1 2 1 / 3 4 3 1 / 3 23

[0597] Assume the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 2}, {1 / 3, 4}. Table 22 shows another example of the combination of coding code rate and number of repetitions corresponding to different coding repetition strategy indexes provided by this public example. The coding repetition strategy index is 0 to 3.

[0598] Table 22

[0599] Index Code Rate Rep 0 1 1 1 1 / 2 1 2 1 / 3 2 3 1 / 3 4

[0600] Assume the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}. Table 23 shows another example of the combination of coding code rate and number of repetitions corresponding to different coding repetition strategy indexes provided by this public example. The coding repetition strategy index is 0 to 3.

[0601] Table 23

[0602] Index Code Rate Rep 0 1 1 1 1 / 2 1 2 1 / 3 1 3 1 / 3 2

[0603] In some specific examples, the parameter list includes 4 combinations of coding code rate and repetition times, and the coding repetition strategy index ranges from 0 to 3. This parameter list is any example of the parameter list corresponding to the above-introduced control information carried on an n = 2-bit sequence, which will not be elaborated one by one here.

[0604] Example 2:

[0605] Assume that the number of bits used to indicate a combination or the index of a combination in the parameter list in the control information is 1.

[0606] Assume the parameter list is: {1, 1}, {1 / 3, 2}. Table 24 shows another example of the combination of coding code rate and repetition times corresponding to different coding repetition strategy indexes provided by this public example, and the coding repetition strategy index ranges from 0 to 1.

[0607] Table 24

[0608] Index Code Rate Rep 0 1 1 1 1 / 3 2

[0609] Among them, if the index value indicated by the control information is 0, the coding code rate is 1 and the repetition times is 1. If the index value indicated by the control information is 1, the coding code rate is 1 / 3 and the repetition times is 2.

[0610] Assume the parameter list is: {1, 1}, {1 / 3, 3}. Table 25 shows another example of the combination of coding code rate and repetition times corresponding to different coding repetition strategy indexes provided by this public example, and the coding repetition strategy index ranges from 0 to 1.

[0611] Table 25

[0612] Index Code Rate Rep 0 1 1 1 1 / 3 3

[0613] Among them, if the index value indicated by the control information is 0, the coding code rate is 1 and the repetition times is 1. If the index value indicated by the control information is 1, the coding code rate is 1 / 3 and the repetition times is 3.

[0614] Assume the parameter list is: {1, 1}, {1 / 3, 4}. Table 26 shows another example of the combination of coding code rate and repetition times corresponding to different coding repetition strategy indexes provided by this public example, and the coding repetition strategy index ranges from 0 to 1.

[0615] Table 26

[0616] Index Code Rate Rep 0 1 1 1 1 / 3 4

[0617] Among them, if the index value indicated by the control information is 0, the coding code rate is 1 and the repetition times is 1. If the index value indicated by the control information is 1, the coding code rate is 1 / 3 and the repetition times is 4.

[0618] Assume the parameter list is: {1, 1}, {1 / 3, 5}. At this time, if the index value indicated by the control information is 0, the coding code rate is 1 and the repetition times is 1. If the index value indicated by the control information is 1, the coding code rate is 1 / 3 and the repetition times is 5.

[0619] Assume the parameter list is: {1, 1}, {1 / 3, 6}. At this time, if the index value indicated by the control information is 0, the coding code rate is 1 and the repetition times is 1. If the index value indicated by the control information is 1, the coding code rate is 1 / 3 and the repetition times is 6.

[0620] Assume the parameter list is: {1, 1}, {1 / 3, 8}. At this time, if the index value indicated by the control information is 0, the coding code rate is 1 and the repetition times is 1. If the index value indicated by the control information is 1, the coding code rate is 1 / 3 and the repetition times is 8.

[0621] Assume the parameter list is: {1, 1}, {1 / 3, 10}. At this time, if the index value indicated by the control information is 0, the coding code rate is 1 and the repetition times is 1. If the index value indicated by the control information is 1, the coding code rate is 1 / 3 and the repetition times is 10.

[0622] Assume the parameter list: {1, 1}, {1 / 3, 12}. At this time, if the index value indicated by the control information is 0, the coding code rate is 1 and the repetition times is 1. If the index value indicated by the control information is 1, the coding code rate is 1 / 3 and the repetition times is 12.

[0623] Assume the parameter list is: {1, 1}, {1 / 3, 16}. At this time, if the index value indicated by the control information is 0, the coding code rate is 1 and the repetition times is 1. If the index value indicated by the control information is 1, the coding code rate is 1 / 3 and the repetition times is 16.

[0624] Assume the parameter list is: {1, 1}, {1 / 3, 24}. At this time, if the index value indicated by the control information is 0, the coding code rate is 1 and the repetition times is 1. If the index value indicated by the control information is 1, the coding code rate is 1 / 3 and the repetition times is 24.

[0625] Assume the parameter list is: {1, 1}, {1 / 3, 32}. At this time, if the index value indicated by the control information is 0, the coding code rate is 1 and the repetition times is 1. If the index value indicated by the control information is 1, the coding code rate is 1 / 3 and the repetition times is 32.

[0626] Assume the parameter list is: {1, 1}, {1 / 3, 48}. At this time, if the index value indicated by the control information is 0, the coding code rate is 1 and the repetition times is 1. If the index value indicated by the control information is 1, the coding code rate is 1 / 3 and the repetition times is 48.

[0627] Example 3:

[0628] Assume the number of bits used to indicate a combination or the index of a combination in the parameter list in the control information is 3.

[0629] Assume the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}, {1 / 3, 32}. As shown in Table 27, it is an example of the combination of coding code rate and repetition times corresponding to another different coding repetition strategy index provided by this public example, and the coding repetition strategy index is 0 to 7.

[0630] Table 27

[0631] Index Code Rate Rep 0 1 1 1 1 / 2 1 2 1 / 3 1 3 1 / 3 2 4 1 / 3 4 5 1 / 3 8 6 1 / 3 16 7 1 / 3 32

[0632] Among them, if the index value indicated by the control information is 0, the coding code rate is 1 and the repetition times is 1. If the index value indicated by the control information is 1, the coding code rate is 1 / 3 and the repetition times is 2, and so on.

[0633] In some embodiments, the combination of coding code rate and repetition times as shown in Table 12 is adopted, the length of the information bit sequence is equal to 96, and simulation is carried out in the AWGN channel. The code block error rate performance is as Figure 9 shown. It can be seen that when the code block error rate reaches 0.1, the signal-to-noise ratio gap between combinations 1 to 7 of the coding code rate and repetition times is about 3 dB, which is suitable for the reader to schedule the tag device to adopt the combination of coding code rate and repetition times that is most suitable for the current channel conditions.

[0634] Assume the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}, {1 / 3, 32}. As shown in Table 28, it is an example of the combination of coding code rate and repetition times corresponding to another different coding repetition strategy index provided by this public example, and the coding repetition strategy index is 0 to 7.

[0635] Table 28

[0636]

[0637]

[0638] In some specific examples, the parameter list includes 8 combinations of coding code rate and repetition times, and the coding repetition strategy index ranges from 0 to 7. This parameter list is any example of the parameter list corresponding to the above-introduced control information carried on an n = 3-bit sequence, which will not be elaborated here one by one.

[0639] Example 4:

[0640] Suppose the number of bits used to indicate a combination or the index of a combination in the control information is 4.

[0641] Suppose the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 8}, {1 / 3, 10}, {1 / 3, 13}, {1 / 3, 16}, {1 / 3, 20}, {1 / 3, 25}, {1 / 3, 32}, {1 / 3, 40}. As shown in Table 29, it is another example of the combination of coding code rate and repetition times corresponding to different coding repetition strategy indexes provided by this disclosure, and the coding repetition strategy index ranges from 0 to 15.

[0642] Table 29

[0643] Index Code Rate Rep 0 1 1 1 1 / 2 1 2 1 / 3 1 3 1 / 3 2 4 1 / 3 3 5 1 / 3 4 6 1 / 3 5 7 1 / 3 6 8 1 / 3 8 9 1 / 3 10 10 1 / 3 13 11 1 / 3 16 12 1 / 3 20 13 1 / 3 25 14 1 / 3 32 15 1 / 3 40

[0644] Among them, if the index value indicated by the control information is 0, the coding code rate is 1 and the repetition times is 1. If the index value indicated by the control information is 5, the coding code rate is 1 / 3 and the repetition times is 4, and so on.

[0645] In some embodiments, the combination of coding code rate and repetition times as shown in Table 14 is adopted, the length of the information bit sequence is equal to 96, and simulation is carried out in an AWGN channel. The code block error rate performance is as Figure 10 shown. It can be seen that when the code block error rate reaches 0.1, the signal-to-noise ratio gap between combinations 1 to 15 of the coding code rate and repetition times is about 1 dB, which is suitable for the reader to schedule the tag device to adopt the combination of coding code rate and repetition times most suitable for the current channel condition.

[0646] Assume the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 8}, {1 / 3, 10}, {1 / 3, 13}, {1 / 3, 16}, {1 / 3, 20}, {1 / 3, 25}, {1 / 3, 32}, {1 / 3, 40}. As shown in Table 30, it is an example of the corresponding coding rate and repetition times combination of another different coding repetition strategy index provided by this public example, and the coding repetition strategy index is 0 to 15.

[0647] Table 30

[0648] Index Code Rate Rep 0 1 1 1 1 / 2 1 2 1 / 2 2 3 1 / 3 2 4 1 / 3 3 5 1 / 3 4 6 1 / 3 5 7 1 / 3 6 8 1 / 3 8 9 1 / 3 10 10 1 / 3 13 11 1 / 3 16 12 1 / 3 20 13 1 / 3 25 14 1 / 3 32 15 1 / 3 40

[0649] In some specific examples, the parameter list includes 16 combinations of coding rate and repetition times. The coding repetition strategy index (Index) is 0 to 15. This parameter list is any one of the parameter list examples corresponding to the above-introduced control information carried on an n = 4-bit sequence, which will not be elaborated here one by one.

[0650] Example 5:

[0651] In some embodiments, the number of bits of the information bit sequence is determined by the control information.

[0652] In this example, the number of bits of the information bit sequence is determined according to the control information, including: determining the number of bits of the information bit sequence from at least one transport block size list (or any one of the first lists introduced above) according to the control information. The control information indicates the transport block size index, and the number of bits of the information bit sequence is determined by the transport block size index. The number of bits of the information bit sequence can be referred to as the transport block size.

[0653] Assume the transport block size index is indicated by 3 bits, including 8 states, and the transport block size index is 0 to 7.

[0654] Exemplarily, as shown in Table 31, the transport block sizes in the transport block size list are positive integer powers of 2, the minimum value is equal to 8, and the maximum value is equal to 1024.

[0655] Table 31

[0656] Idx 0 1 2 3 4 5 6 7 TBS 8 16 32 64 128 256 512 1024

[0657] Exemplarily, as shown in Table 32, the number of elements in the transport block size list is equal to 8, the minimum value is equal to 8, and the maximum value is equal to 1000.

[0658] Table 32

[0659] Idx 0 1 2 3 4 5 6 7 TBS 8 20 32 64 96 256 400 1000

[0660] In some specific examples, the transport block size list includes 8 transport block sizes, and the transport block size index ranges from 0 to 7. This transport block size list is an example of any of the first lists including 8 transport block sizes introduced above, and will not be elaborated here one by one.

[0661] Assume that it is indicated by 4 bits, including 16 states, and the transport block size index ranges from 0 to 15.

[0662] Exemplarily, as shown in Table 33, the minimum value in the transport block size list is equal to 8, and the maximum value is equal to 864.

[0663] Table 33

[0664] Idx 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 TBS 8 16 24 32 48 64 80 96 160 224 288 352 480 608 736 864

[0665] Exemplarily, as shown in Table 34, the number of elements in the transport block size list is equal to 16, the minimum value is equal to 8, and the maximum value is equal to 1000.

[0666] Table 34

[0667] Idx 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 TBS 20 32 48 64 80 96 128 192 256 320 400 528 656 784 912 1000

[0668] In some specific examples, the transport block size list includes 16 transport block sizes, and the transport block size index ranges from 0 to 15. This transport block size list is an example of any of the first lists including 15 transport block sizes introduced above, and will not be elaborated here one by one.

[0669] Assume that the transport block size index is indicated by 5 bits, including 32 states, and the transport block size index ranges from 0 to 31. Exemplarily, as shown in Table 35, the minimum value in the transport block size list is equal to 8, and the maximum value is equal to 1024.

[0670] Table 35

[0671] Idx 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 TBS 8 16 24 32 40 48 56 64 72 80 88 96 104 112 120 128 Idx 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 TBS 160 192 224 256 320 384 448 512 576 640 704 768 832 896 960 1024

[0672] Exemplarily, as shown in Table 36, the number of elements in the transport block size list is equal to 32, the minimum value is equal to 8, and the maximum value is equal to 1000.

[0673] Table 36

[0674] Idx 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 TBS 8 16 20 24 32 40 48 56 64 72 80 88 96 104 112 120 Idx 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 TBS 128 144 176 208 240 272 304 336 368 400 432 512 640 768 896 1000

[0675] In some specific examples, the transport block size list includes 32 transport block sizes, and the transport block size index ranges from 0 to 31. This transport block size list is an example of any of the first lists including 32 transport block sizes introduced above, and will not be elaborated here one by one.

[0676] In some embodiments, the number of bits of the information bit sequence is determined by the transport block size index and the frequency shift factor.

[0677] Exemplarily, as shown in Table 37, the transport block size index ranges from 0 to 15, and the frequency shift factor includes at least one of the following: 2, 8, 16, 32, 64, 128, 256. As shown in Table 22, M is the frequency shift factor and Idx is the transport block size index.

[0678] Table 37

[0679]

[0680] Wherein, when M is equal to 8 and Idx is equal to 7, the number of bits of the information bit sequence is equal to 96; and if M is equal to 16 and Idx is equal to 15, the number of bits of the information bit sequence is equal to 1000.

[0681] Example 6

[0682] In this example, a communication method for a first node is provided, and the communication method includes the following steps:

[0683] Step 1, receive control information from a second node, where the control information at least includes a transport block size index.

[0684] Step 2, determine the transport block size based on the control information.

[0685] Step 3, generate a first sequence based on an information bit sequence whose number of bits is equal to the transport block size.

[0686] Step 4, send the first sequence to the second node.

[0687] Wherein, the transport block size index is located at the forefront of the control information. For example, the control information is carried on a bit sequence, and the transport block size index is in the first n bits of the control information bit sequence, that is, the first n bits of the control information bit sequence are the transport block size index, where n is the number of bits used to carry the transport block size index. The beneficial effect of such an operation is that when the first node (user equipment or tag equipment) receives the first n bits, it can immediately know the number of bits of the data to be sent to the second node (such as a base station or a reader). The first node (user equipment or tag equipment) can read the corresponding information bit sequence in advance to calculate the check bits of the cyclic redundancy check (CRC), thereby reducing the waiting time between CRC calculation and convolutional coding calculation, and thus saving data waiting and improving the efficiency of data processing.

[0688] In some embodiments, the transport block size is determined based on control information including at least a transport block size index. Among them, the process of determining the transport block size is any of the methods introduced above, and the sampled first list (transport block size list) can be any of the above tables.

[0689] In some embodiments, a first sequence is generated based on an information bit sequence whose number of bits is equal to the transport block size, including: adding CRC check bits to the information bit sequence to obtain a CRC-encoded sequence; performing convolutional coding on the CRC-encoded sequence based on a coding rate to obtain an encoded bit sequence; performing a repetition process on the encoded bit sequence based on a repetition count to obtain a first sequence.

[0690] In some embodiments, CRC check bits are added to the information bit sequence to obtain a CRC-encoded sequence, where the CRC generation polynomial is at least one of the following: g CRC6 (D)=[D 6 +D 5 +1], g CRC16 (D)=[D 16 +D 12 +D 5 +1]. Among them, the CRC check bits corresponding to the two generation polynomials are 6 bits and 16 bits respectively.

[0691] In another example, a communication method for a first node is provided. The communication method includes the following steps:

[0692] Step 1: Receive control information from a second node, where the control information includes at least a transport block size index and a data storage start position.

[0693] Step 2: Determine the transport block size based on the control information.

[0694] Step 3: Generate a first sequence based on an information bit sequence whose number of bits is equal to the transport block size.

[0695] Step 4: Send the first sequence to the second node.

[0696] Among them, the transport block size index and the data storage start position are at the forefront of the control information. For example, the control information is carried on a bit sequence, and the transport block size index and the data storage start position are in the first n + m bits of the bit sequence, where n is the number of bits used to carry the transport block size index, and m is the number of bits used to carry the data storage start position. That is, the first n bits of the control information bit sequence are the transport block size index, and the nth to the (n + m - 1)th bits of the control information bit sequence are the data storage start position. In a specific example, the transport block size index is at the forefront of the control information bit sequence, including n bits; the data storage start position is adjacent to and after the transport block size index in the control information bit sequence. Alternatively, the data storage start position is at the forefront of the control information bit sequence, adjacent to and followed by the transport block size index. That is, the first m bits of the control information bit sequence are the data storage start position, and the mth to the (n + m - 1)th bits of the control information bit sequence are the transport block size index. Among them, both n and m are positive integers.

[0697] This information bit sequence is determined according to the data storage start position and the transport block size index. For example, starting from this data storage start position, the number of bits read is determined by the transport block size index. When the first node (user equipment or tag equipment) receives the first n bits, it can immediately determine the information bit sequence to be sent to the second node (such as a base station or a reader). The first node (user equipment or tag equipment) can pre-read the corresponding information bit sequence to calculate the check bits of the cyclic redundancy check (CRC), thereby reducing the waiting time between CRC calculation and convolutional coding calculation, and thus saving data waiting and improving the efficiency of data processing.

[0698] In some embodiments, based on the control information at least including the transport block size index, the transport block size is determined. Among them, the process of determining the transport block size is any of the methods introduced above, and the sampled first list (transport block size list) can be any of the above tables.

[0699] In some embodiments, based on an information bit sequence whose bit number is equal to the transport block size, a first sequence is generated, including: adding CRC check bits to the information bit sequence to obtain a CRC encoded sequence; performing convolutional coding on the CRC encoded sequence based on the coding rate to obtain an encoded bit sequence; performing a repetition process on the encoded bit sequence based on the repetition times to obtain the first sequence.

[0700] In another example, a communication method for a first node is given. This communication method includes the following steps:

[0701] Step 1: Receive control information from a second node, where the control information at least includes a transport block size index and a message type.

[0702] Step 2: Determine the transport block size based on the control information.

[0703] Step 3: Generate a first sequence based on an information bit sequence whose number of bits is equal to the transport block size.

[0704] Step 4: Send the first sequence to the second node.

[0705] Wherein, the transport block size index is at the forefront of the control information. For example, the control information is carried on a bit sequence, and the transport block size index is in the first n bits of the bit sequence, where n is the number of bits used to carry the transport block size index.

[0706] Wherein, the transport block size index and the message type are at the forefront of the control information. For example, the control information is carried on a bit sequence, and the transport block size index and the message type are in the first n + v bits of the bit sequence, where n is the number of bits used to carry the transport block size index, and v is the number of bits used to carry the message type. That is, the first n bits of the control information bit sequence are the transport block size index, and the nth to the (n + v - 1)th bits of the control information bit sequence are the message type. In a specific example, the transport block size index is at the forefront of the control information bit sequence and includes n bits; the message type is adjacent to and after the transport block size index in the control information bit sequence. Alternatively, the message type is at the forefront of the control information bit sequence, adjacent to and followed by the transport block size index. That is, the first v bits of the control information bit sequence are the message type, and the vth to the (n + v - 1)th bits of the control information bit sequence are the transport block size index. Wherein, n and v are both positive integers.

[0707] In some embodiments, determine the transport block size based on control information that at least includes a transport block size index. Wherein, the process of determining the transport block size is any of the methods introduced above, and the sampled first list (transport block size list) can be any of the above tables.

[0708] In some embodiments, the message type is located after the transport block size index in the control information and is adjacent to the transport block size index. When the first node (user equipment or tag device) obtains the transport block size index in the control information, it can determine whether the information belongs to itself according to the message type. If not, it can ignore the indication of the transport block size index, thereby reducing some computational processing operations and the power consumption of the user equipment. When it is determined according to the message type that the information belongs to itself, the transport block size can be determined according to the control information including at least the transport block size index. Among them, the process of determining the transport block size is any of the methods introduced above, and the sampled first list (transport block size list) can be any of the above tables. Then, based on the information bit sequence with the number of bits equal to the transport block size, a first sequence is generated, including: adding CRC check bits to the information bit sequence to obtain a CRC-encoded sequence; performing convolutional coding on the CRC-encoded sequence based on the coding rate to obtain an encoded bit sequence; performing a repetition process on the encoded bit sequence based on the repetition times to obtain the first sequence.

[0709] In another example, a communication method for a first node is provided, and the communication method includes the following steps:

[0710] Step 1, receive first control information from a second node, where the first control information includes at least a message type.

[0711] Step 2, receive second control information from the second node, where the second control information includes at least a transport block size index.

[0712] Step 3, determine the transport block size based on the second control information.

[0713] Step 4, generate a first sequence based on the information bit sequence with the number of bits equal to the transport block size.

[0714] Step 5, send the first sequence to the second node.

[0715] Among them, the message type is located at the forefront of the first control information. For example, the first control information is carried on a bit sequence, and the message type is in the first v bits of the bit sequence, where v is the number of bits used to carry the message type.

[0716] Among them, the transport block size index is located at the forefront of the second control information. For example, the second control information is carried on a bit sequence, and the transport block size index is in the first n bits of the bit sequence, where n is the number of bits used to carry the transport block size index.

[0717] The first node (user equipment or tag equipment) can, when obtaining the transport block size index, determine whether it belongs to its own information according to the message type. If not, it can ignore the indication of the transport block size index. When it is determined according to the message type that it belongs to its own information, the transport block size can be determined according to the transport block size index. Among them, the process of determining the transport block size is any of the methods introduced above, and the sampled first list (transport block size list) can be any of the above tables. Then, based on the information bit sequence with the number of bits equal to the transport block size, a first sequence is generated, including: adding CRC check bits to the information bit sequence to obtain a CRC-encoded sequence; performing convolutional coding on the CRC-encoded sequence based on the coding rate to obtain an encoded bit sequence; performing a repetition process on the encoded bit sequence based on the repetition times to obtain the first sequence.

[0718] The communication method provided by the embodiments of the present disclosure can be applied to Figure 1 the second node 102 in the communication system shown in Figure 11 FIG. shows a schematic flowchart of a communication method, as Figure 11 shown, the communication method includes the following S1101-S1103:

[0719] S1101. Send control information to the first node, where the control information is used to determine the coding rate and / or the repetition times.

[0720] S1102. Receive the first sequence sent by the first node.

[0721] S1103. Perform processing on the first sequence based on the coding rate and / or the repetition times to obtain an information bit sequence.

[0722] In some embodiments, the coding rate includes at least one of the following: 1, 8 / 9, 7 / 8, 6 / 7, 5 / 6, 4 / 5, 3 / 4, 2 / 3, 3 / 5, 5 / 8, 1 / 2, 1 / 3.

[0723] In some embodiments, the repetition times include at least one of the following: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 22, 24, 32, 36, 40, 48, 56, 64.

[0724] In some embodiments, the control information is used to determine the coding rate and the repetition times from a parameter list; the parameter list includes N candidate combinations, and one candidate combination includes a candidate coding rate and a candidate repetition times, and N is a positive integer.

[0725] In some embodiments, a combination formed by a candidate coding rate and a candidate repetition times is referred to as a coding repetition strategy.

[0726] In some embodiments, control information is carried on a bit sequence, and the bit sequence includes n bits for indicating a candidate combination or an index of a candidate combination in a parameter list, where 2 to the power of n is equal to N, and n is a positive integer.

[0727] In some embodiments, n is 1, and the parameter list is one of the following:

[0728] {1, 1}, {1 / 3, 1}; {1, 1}, {1 / 3, 2}; {1, 1}, {1 / 3, 3}; {1, 1}, {1 / 3, 4}; {1, 1}, {1 / 3, 5}; {1, 1}, {1 / 3, 6}; {1, 1}, {1 / 3, 8}; {1, 1}, {1 / 3, 10}; {1, 1}, {1 / 3, 12}; {1, 1}, {1 / 3, 16}; {1, 1}, {1 / 3, 24}; {1, 1}, {1 / 3, 32}; {1, 1}, {1 / 3, 48}.

[0729] In some embodiments, n is 2, and the repetition times corresponding to a coding rate equal to 1 / 2 in the parameter list are equal to 1 or 2. In some other embodiments, n is 2, and the maximum value of the repetition times corresponding to a coding rate equal to 1 / 2 in the parameter list is equal to 2, and / or the minimum value is equal to 1. In some other embodiments, n is 2, and the minimum value of the repetition times corresponding to a coding rate equal to 1 / 3 in the parameter list is equal to 1. In some other embodiments, n is 2, and the maximum value of the repetition times corresponding to a coding rate equal to 1 / 3 in the parameter list is equal to 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 16, 20, 24, 28, 32, 36 or 40. In some other embodiments, n is 2, and the number of candidate combinations corresponding to a coding rate equal to 1 / 3 in the parameter list is equal to 2 or 3.

[0730] In some other embodiments, n is 2, and the number of candidate combinations corresponding to a coding rate equal to 1 / 3 in the parameter list is equal to 3. The difference between the ratio of the repetition times of the first candidate combination and the repetition times of the 0th candidate combination and the ratio of the repetition times of the second candidate combination and the repetition times of the first candidate combination in the 3 candidate combinations is not greater than 0.1, 0.2, 0.3, 0.5, 1, 1.5, 2 or 3.

[0731] In some other embodiments, n is 2, and the number of candidate combinations corresponding to a coding rate equal to 1 / 3 in the parameter list is equal to 3. The ratio of the repetition times of the first candidate combination and the repetition times of the 0th candidate combination in the 3 candidate combinations is equal to the ratio of the repetition times of the second candidate combination and the repetition times of the first candidate combination. In some other embodiments, the ratio is equal to 1.5, 2, 3, 4, 5, 6, 7 or 8.

[0732] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 2}, {1 / 3, 6}.

[0733] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 6}.

[0734] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}.

[0735] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 4}, {1 / 3, 16}.

[0736] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 24}.

[0737] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 25}.

[0738] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 23}.

[0739] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 6}, {1 / 3, 36}.

[0740] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 3}, {1 / 3, 9}.

[0741] In some embodiments, n is 2, the number of candidate combinations is equal to 4, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 5}, {1 / 3, 25}.

[0742] In some embodiments, n is 2, and the parameter list is one of the following:

[0743] 0: {1, 1}, {1 / 2, 1}, {1 / 3, 2}, {1 / 3, 6};

[0744] 1: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 6};

[0745] 2：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、4}；

[0746] 3：{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、16}；

[0747] 4：{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、24}；

[0748] 5：{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、25}；

[0749] 6：{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、23}。

[0750] 7：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}；

[0751] 8：{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、6}；

[0752] 9：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、8}；

[0753] 10：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、8}；

[0754] 11：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、16}；

[0755] 12：{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、6}；

[0756] 13：{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、12}；

[0757] 14：{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、12}。

[0758] 15：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、3}；

[0759] 16：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}；

[0760] 17：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、4}；

[0761] 18：{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、4}；

[0762] 19：{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、4}；

[0763] 20：{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、5}；

[0764] 21：{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、5}；

[0765] 22：{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、5}；

[0766] 23：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、5}；

[0767] 24：{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、6}；

[0768] 25：{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、6}；

[0769] 26：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、6}；

[0770] 27：{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、6}；

[0771] 28：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、8}；

[0772] 29：{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、8}；

[0773] 30：{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、8}；

[0774] 31：{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、8}；

[0775] 32：{1、1}，{1 / 2、1}，{1 / 3、5}，{1 / 3、8}；

[0776] 33：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、8}；

[0777] 34：{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、8}；

[0778] 35：{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、8}；

[0779] 36：{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、8}；

[0780] 37：{1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、8}；

[0781] 38：{1、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、8}；

[0782] 39：{1、1}，{1 / 3、2}，{1 / 3、4}，{1 / 3、8}；

[0783] 40：{1、1}，{1 / 3、2}，{1 / 3、5}，{1 / 3、8}；

[0784] 41：{1、1}，{1 / 3、2}，{1 / 3、6}，{1 / 3、8}；

[0785] 42：{1、1}，{1 / 3、3}，{1 / 3、5}，{1 / 3、8}；

[0786] 43：{1、1}，{1 / 3、3}，{1 / 3、6}，{1 / 3、8}；

[0787] 44：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、10}；

[0788] 45：{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、10}；

[0789] 46：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、10}；

[0790] 47：{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、10}；

[0791] 48：{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、10}；

[0792] 49：{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、10}；

[0793] 50：{1、1}，{1 / 3、2}，{1 / 3、4}，{1 / 3、10}；

[0794] 51：{1、1}，{1 / 3、2}，{1 / 3、5}，{1 / 3、10}；

[0795] 52: {1, 1}, {1 / 3, 1}, {1 / 3, 4}, {1 / 3, 12};

[0796] 53: {1, 1}, {1 / 3, 1}, {1 / 3, 5}, {1 / 3, 12};

[0797] 54: {1, 1}, {1 / 3, 1}, {1 / 3, 6}, {1 / 3, 12};

[0798] 55: {1, 1}, {1 / 3, 1}, {1 / 3, 7}, {1 / 3, 12};

[0799] 56: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 2, 2};

[0800] 57: {1, 1}, {1 / 3, 1}, {1 / 3, 8}, {1 / 3, 12}. In some embodiments, n is 2, and the parameter list is one of the following: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 2, 2};

[0801] {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2};

[0802] {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2};

[0803] {1, 1}, {1 / 3, 1}, {1 / 2, 2}, {1 / 3, 2};

[0804] {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3};

[0805] {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 3};

[0806] {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4};

[0807] {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 4};

[0808] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、5}；{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、5}；{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、6}；{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、6}；{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、7}；{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、7}；{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、8}；{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、8}；{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、9}；{1、1}，{1 / 2、1}，{1 / 3、2}，{1 / 3、9}；{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、10}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、10}；{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、11}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、11}；{1、1}，{1 / 3、1}，{1 / 3、3}，{1 / 3、12}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、12}；{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、13}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、13}；{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、14}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、14}；{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、15}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、15}；{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、16}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、16}；{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、17}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、17}；{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、18}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、18}；{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、19}；{1、1}，{1 / 2、1}，{1 / 3、3}，{1 / 3、19}；{1、1}，{1 / 3、1}，{1 / 3、4}，{1 / 3、20}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、20}；{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、21}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、21}；{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、22}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、22}；{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、23}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、23}；{1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、24}；{1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、24}；

[0809] {1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、25}；

[0810] {1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、25}；

[0811] {1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、26}；

[0812] {1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、26}；

[0813] {1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、27}；

[0814] {1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、27}；

[0815] {1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、28}；

[0816] {1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、28}；

[0817] {1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、29}；

[0818] {1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、29}；

[0819] {1、1}，{1 / 3、1}，{1 / 3、5}，{1 / 3、30}；

[0820] {1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、30}；

[0821] {1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、31}；

[0822] {1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、31}；

[0823] {1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、32}；

[0824] {1、1}，{1 / 2、1}，{1 / 3、4}，{1 / 3、32}；

[0825] {1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、33}；

[0826] {1、1}，{1 / 2、1}，{1 / 3、5}，{1 / 3、33}；

[0827] {1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、34}；

[0828] {1、1}，{1 / 2、1}，{1 / 3、5}，{1 / 3、34}；

[0829] {1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、35}；

[0830] {1、1}，{1 / 2、1}，{1 / 3、5}，{1 / 3、35}；

[0831] {1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、36}；

[0832] {1、1}，{1 / 2、1}，{1 / 3、5}，{1 / 3、36}；

[0833] {1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、37}；

[0834] {1、1}，{1 / 2、1}，{1 / 3、5}，{1 / 3、37}；

[0835] {1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、38}；

[0836] {1、1}，{1 / 2、1}，{1 / 3、5}，{1 / 3、38}；

[0837] {1、1}，{1 / 3、1}，{1 / 3、6}，{1 / 3、39}；

[0838] {1、1}，{1 / 2、1}，{1 / 3、5}，{1 / 3、39}；

[0839] {1, 1}, {1 / 3, 1}, {1 / 3, 6}, {1 / 3, 40};

[0840] {1, 1}, {1 / 2, 1}, {1 / 3, 5}, {1 / 3, 40}.

[0841] In some embodiments, n is 3, and the number of repetitions corresponding to a coding rate equal to 1 / 2 in the parameter list is equal to 1 or 2. In some other embodiments, n is 3, and the maximum value of the number of repetitions corresponding to a coding rate equal to 1 / 2 in the parameter list is equal to 2, and / or the minimum value is equal to 1.

[0842] In some other embodiments, n is 3, and the minimum value of the number of repetitions corresponding to a coding rate equal to 1 / 3 in the parameter list is equal to 1. In some other embodiments, n is 3, and the number of candidate combinations corresponding to a coding rate equal to 1 / 3 in the parameter list is equal to 5, 6, or 7. In some other embodiments, n is 3, and the maximum value of the number of repetitions corresponding to a coding rate equal to 1 / 3 in the parameter list is equal to 5, 6, 7, 8, 9, 10, 12, 16, 20, 24, 28, 32, 36, or 40.

[0843] In some other embodiments, n is 3, and for any two adjacent numbers of repetitions in the candidate combinations corresponding to a coding rate equal to 1 / 3 in the parameter list, the ratio (the value obtained by dividing the larger number of repetitions by the smaller number of repetitions) is not greater than 1.1, 1.2, 1.5, 1.8, 2, 2.2, 2.5, 3, or 4.

[0844] In some other embodiments, n is 3, and for all ratios (the value obtained by dividing the larger number of repetitions by the smaller number of repetitions) of any two adjacent numbers of repetitions in the candidate combinations corresponding to a coding rate equal to 1 / 3 in the parameter list, the difference between the maximum ratio and the minimum ratio is not greater than 0.1, 0.2, 0.3, 0.5, 1, 1.5, 2, 3, or 4.

[0845] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}, {1 / 3, 32}.

[0846] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}, {1 / 3, 32}.

[0847] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}.

[0848] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}.

[0849] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}.

[0850] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 8}.

[0851] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 12}, {1 / 3, 16}.

[0852] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}.

[0853] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 6}, {1 / 3, 8}, {1 / 3, 12}, {1 / 3, 16}.

[0854] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 5}, {1 / 3, 8}, {1 / 3, 14}, {1 / 3, 24}.

[0855] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 7}, {1 / 3, 13}, {1 / 3, 24}.

[0856] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 9}, {1 / 3, 17}, {1 / 3, 32}.

[0857] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 6}, {1 / 3, 11}, {1 / 3, 20}, {1 / 3, 36}.

[0858] In some embodiments, n is 3, the number of candidate combinations is equal to 8, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 5}, {1 / 3, 9}, {1 / 3, 18}, {1 / 3, 36}.

[0859] In some embodiments, n is 3, and the parameter list is one of the following:

[0860] 1: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}, {1 / 3, 32};

[0861] 2: {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}, {1 / 3, 32}.

[0862] 3: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 6}, {1 / 3, 8};

[0863] 4: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 8};

[0864] 5: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 5}, {1 / 3, 7}, {1 / 3, 8};

[0865] 6：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、5}，{1 / 3、7}，{1 / 3、8}；

[0866] 8：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、3}，{1 / 3、5}，{1 / 3、7}，{1 / 3、9}；

[0867] 9：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、5}，{1 / 3、7}，{1 / 3、9}；

[0868] 10：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、5}，{1 / 3、7}，{1 / 3、9}；

[0869] 11：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、6}，{1 / 3、8}，{1 / 3、10}；

[0870] 12：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、3}，{1 / 3、5}，{1 / 3、7}，{1 / 3、10}；

[0871] 13：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、6}，{1 / 3、8}，{1 / 3、10}；

[0872] 14：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、5}，{1 / 3、7}，{1 / 3、9}，{1 / 3、10}；

[0873] 15：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、5}，{1 / 3、8}，{1 / 3、10}；

[0874] 16：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、6}，{1 / 3、8}，{1 / 3、12}；

[0875] 17：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、7}，{1 / 3、9}，{1 / 3、12}；

[0876] 18：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、8}，{1 / 3、10}，{1 / 3、12}；

[0877] 19：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、4}、{1 / 3、6}，{1 / 3、8}，{1 / 3、10}，{1 / 3、12}；

[0878] 20：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、5}，{1 / 3、7}，{1 / 3、9}，{1 / 3、12}；

[0879] 21：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、7}，{1 / 3、10}，{1 / 3、12}；

[0880] 22：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、8}，{1 / 3、10}，{1 / 3、12}；

[0881] 23：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、6}，{1 / 3、9}，{1 / 3、12}；

[0882] 24：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、6}，{1 / 3、10}，{1 / 3、14}；

[0883] 25：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、8}，{1 / 3、11}，{1 / 3、14}；

[0884] 26：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、7}，{1 / 3、10}，{1 / 3、14}；

[0885] 27：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、4}、{1 / 3、8}，{1 / 3、10}，{1 / 3、12}，{1 / 3、14}；

[0886] 28：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、5}，{1 / 3、7}，{1 / 3、10}，{1 / 3、14}；

[0887] 29：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、7}，{1 / 3、10}，{1 / 3、14}；

[0888] 30：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、5}，{1 / 3、10}，{1 / 3、14}；

[0889] 31：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、5}，{1 / 3、8}，{1 / 3、11}，{1 / 3、14}；

[0890] 32：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、8}，{1 / 3、12}，{1 / 3、16}；

[0891] 33：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、3}，{1 / 3、4}，{1 / 3、8}，{1 / 3、16}；

[0892] 34：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、4}、{1 / 3、6}，{1 / 3、8}，{1 / 3、12}，{1 / 3、16}；

[0893] 35：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、5}，{1 / 3、8}，{1 / 3、12}，{1 / 3、16}；

[0894] 36：{1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}、{1 / 3、4}，{1 / 3、6}，{1 / 3、11}，{1 / 3、16}；

[0895] 37：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、8}，{1 / 3、14}，{1 / 3、20}；

[0896] 38：{1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、3}，{1 / 3、5}，{1 / 3、10}，{1 / 3、20}；

[0897] 39: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 12}, {1 / 3, 16}, {1 / 3, 20};

[0898] 40: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 6}, {1 / 3, 10}, {1 / 3, 14}, {1 / 3, 20};

[0899] 41: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 7}, {1 / 3, 11}, {1 / 3, 15}, {1 / 3, 20};

[0900] 42: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}, {1 / 3, 24};

[0901] 43: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}, {1 / 3, 24};

[0902] 44: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 7};

[0903] 45: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 6}, {1 / 3, 7};

[0904] 46: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7};

[0905] 47: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}.

[0906] In some embodiments, n is 3, and the parameter list is one of the following:

[0907] {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5};

[0908] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、6}；

[0909] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}；

[0910] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、7}；

[0911] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、8}；

[0912] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、8}；

[0913] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、9}；

[0914] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、6}，{1 / 3、9}；

[0915] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、7}，{1 / 3、10}；

[0916] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、6}，{1 / 3、10}；

[0917] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、7}，{1 / 3、11}；

[0918] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、7}，{1 / 3、11}；

[0919] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、8}，{1 / 3、12}；

[0920] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、7}，{1 / 3、12}；

[0921] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、6}，{1 / 3、9}，{1 / 3、13}；

[0922] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、8}，{1 / 3、13}；

[0923] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、6}，{1 / 3、9}，{1 / 3、14}；

[0924] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、8}，{1 / 3、14}；

[0925] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、6}，{1 / 3、10}，{1 / 3、15}；

[0926] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、9}，{1 / 3、15}；

[0927] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、6}，{1 / 3、10}，{1 / 3、16}；

[0928] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、9}，{1 / 3、16}；

[0929] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、7}，{1 / 3、11}，{1 / 3、17}；

[0930] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、10}，{1 / 3、17}；

[0931] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、7}，{1 / 3、11}，{1 / 3、18}；

[0932] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、10}，{1 / 3、18}；

[0933] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、7}，{1 / 3、12}，{1 / 3、19}；

[0934] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、11}，{1 / 3、19}；

[0935] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、7}，{1 / 3、12}，{1 / 3、20}；

[0936] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、4}，{1 / 3、6}，{1 / 3、11}，{1 / 3、20}；

[0937] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、8}，{1 / 3、13}，{1 / 3、21}；

[0938] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、7}，{1 / 3、12}，{1 / 3、21}；

[0939] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、8}，{1 / 3、13}，{1 / 3、22}；

[0940] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、7}，{1 / 3、12}，{1 / 3、22}；

[0941] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、8}，{1 / 3、14}，{1 / 3、23}；

[0942] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、7}，{1 / 3、13}，{1 / 3、23}；

[0943] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、8}，{1 / 3、14}，{1 / 3、24}；

[0944] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、7}，{1 / 3、13}，{1 / 3、24}；

[0945] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、9}，{1 / 3、15}，{1 / 3、25}；

[0946] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、7}，{1 / 3、14}，{1 / 3、25}；

[0947] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、9}，{1 / 3、15}，{1 / 3、26}；

[0948] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、7}，{1 / 3、14}，{1 / 3、26}；

[0949] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、9}，{1 / 3、16}，{1 / 3、27}；

[0950] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、8}，{1 / 3、14}，{1 / 3、27}；

[0951] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、9}，{1 / 3、16}，{1 / 3、28}；

[0952] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、8}，{1 / 3、15}，{1 / 3、28}；

[0953] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、9}，{1 / 3、16}，{1 / 3、29}；

[0954] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、8}，{1 / 3、15}，{1 / 3、29}；

[0955] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、5}，{1 / 3、10}，{1 / 3、17}，{1 / 3、30}；

[0956] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、8}，{1 / 3、16}，{1 / 3、30}；

[0957] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、10}，{1 / 3、17}，{1 / 3、31}；

[0958] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、8}，{1 / 3、16}，{1 / 3、31}；

[0959] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、10}，{1 / 3、18}，{1 / 3、32}；

[0960] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、4}，{1 / 3、9}，{1 / 3、17}，{1 / 3、32}；

[0961] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、10}，{1 / 3、18}，{1 / 3、33}；

[0962] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、5}，{1 / 3、9}，{1 / 3、17}，{1 / 3、33}；

[0963] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、10}，{1 / 3、19}，{1 / 3、34}；

[0964] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、5}，{1 / 3、9}，{1 / 3、17}，{1 / 3、34}；

[0965] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、11}，{1 / 3、19}，{1 / 3、35}；

[0966] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、5}，{1 / 3、9}，{1 / 3、18}，{1 / 3、35}；

[0967] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、11}，{1 / 3、20}，{1 / 3、36}；

[0968] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、5}，{1 / 3、9}，{1 / 3、18}，{1 / 3、36}；

[0969] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、11}，{1 / 3、20}，{1 / 3、37}；

[0970] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、5}，{1 / 3、10}，{1 / 3、19}，{1 / 3、37}；

[0971] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、11}，{1 / 3、21}，{1 / 3、38}；

[0972] {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、5}，{1 / 3、10}，{1 / 3、19}，{1 / 3、38}；

[0973] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、6}，{1 / 3、11}，{1 / 3、21}，{1 / 3、39}；

[0974] {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 3}, {1 / 3, 5}, {1 / 3, 10}, {1 / 3, 20}, {1 / 3, 39};

[0975] {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 6}, {1 / 3, 12}, {1 / 3, 22}, {1 / 3, 40};

[0976] {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 3}, {1 / 3, 5}, {1 / 3, 10}, {1 / 3, 20}, {1 / 3, 40}.

[0977] In some embodiments, n is 4, and the repetition times corresponding to the coding code rate equal to 1 / 2 in the parameter list are equal to 1 or 2. In some other embodiments, n is 4, the maximum value of the repetition times corresponding to the coding code rate equal to 1 / 2 in the parameter list is equal to 2, and / or the minimum value is equal to 1.

[0978] In some other embodiments, n is 4, and the minimum value of the repetition times corresponding to the coding code rate equal to 1 / 3 in the parameter list is equal to 1. In some other embodiments, n is 4, and the number of candidate combinations corresponding to the coding code rate equal to 1 / 3 in the parameter list is equal to 13, 14, or 15. In some other embodiments, n is 4, and the maximum value of the repetition times corresponding to the coding code rate equal to 1 / 3 in the parameter list is equal to 5, 6, 7, 8, 9, 10, 12, 16, 20, 24, 28, 32, 36, or 40.

[0979] In some other embodiments, n is 4, and for any two adjacent repetition times in the candidate combinations corresponding to the coding code rate equal to 1 / 3 in the parameter list, the ratio (the value obtained by dividing the larger repetition time by the smaller repetition time) is not greater than 1.1, 1.2, 1.5, 1.8, 2, 2.2, 2.5, 3, or 4.

[0980] In some other embodiments, n is 4, and for all ratios (the values obtained by dividing the larger repetition time by the smaller repetition time) of any two adjacent repetition times in the candidate combinations corresponding to the coding code rate equal to 1 / 3 in the parameter list, the difference between the maximum ratio and the minimum ratio is not greater than 0.1, 0.2, 0.3, 0.5, 1, 1.5, 2, 3, or 4.

[0981] In some embodiments, n is 4, the number of candidate combinations is equal to 16, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 8}, {1 / 3, 10}, {1 / 3, 13}, {1 / 3, 16}, {1 / 3, 20}, {1 / 3, 25}, {1 / 3, 32}, {1 / 3, 40}.

[0982] In some embodiments, n is 4, the number of candidate combinations is equal to 16, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 8}, {1 / 3, 10}, {1 / 3, 13}, {1 / 3, 16}, {1 / 3, 20}, {1 / 3, 25}, {1 / 3, 32}, {1 / 3, 40}.

[0983] In some embodiments, n is 4, the number of candidate combinations is equal to 16, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 8}, {1 / 3, 9}, {1 / 3, 10}, {1 / 3, 11}, {1 / 3, 12}, {1 / 3, 13}, {1 / 3, 14}, {1 / 3, 16}.

[0984] In some embodiments, n is 4, the number of candidate combinations is equal to 16, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 8}, {1 / 3, 9}, {1 / 3, 10}, {1 / 3, 11}, {1 / 3, 12}, {1 / 3, 15}, {1 / 3, 19}, {1 / 3, 24}.

[0985] In some embodiments, n is 4, the number of candidate combinations is equal to 16, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 8}, {1 / 3, 9}, {1 / 3, 10}, {1 / 3, 12}, {1 / 3, 15}, {1 / 3, 20}, {1 / 3, 25}, {1 / 3, 32}.

[0986] In some embodiments, n is 4, the number of candidate combinations is equal to 16, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 8}, {1 / 3, 10}, {1 / 3, 14}, {1 / 3, 18}, {1 / 3, 24}, {1 / 3, 32}.

[0987] In some embodiments, n is 4, the number of candidate combinations is equal to 16, and the parameter list is: {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 8}, {1 / 3, 9}, {1 / 3, 10}, {1 / 3, 13}, {1 / 3, 17}, {1 / 3, 22}, {1 / 3, 28}, {1 / 3, 36}.

[0988] In some embodiments, n is 4, the number of candidate combinations is equal to 16, and the parameter list is: {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 8}, {1 / 3, 11}, {1 / 3, 15}, {1 / 3, 20}, {1 / 3, 27}, {1 / 3, 36}.

[0989] In some embodiments, n is 4, and the parameter list is one of the following:

[0990] {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 8}, {1 / 3, 10}, {1 / 3, 13}, {1 / 3, 16}, {1 / 3, 20}, {1 / 3, 25}, {1 / 3, 32}, {1 / 3, 40};

[0991] {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 8}, {1 / 3, 10}, {1 / 3, 13}, {1 / 3, 16}, {1 / 3, 20}, {1 / 3, 25}, {1 / 3, 32}, {1 / 3, 40}.

[0992] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、13}；

[0993] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、14}；

[0994] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、13}，{1 / 3、14}，{1 / 3、15}；

[0995] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、15}；

[0996] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、13}，{1 / 3、14}，{1 / 3、16}；

[0997] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、13}，{1 / 3、16}；

[0998] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、13}，{1 / 3、14}，{1 / 3、17}；

[0999] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、13}，{1 / 3、17}；

[1000] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、13}，{1 / 3、15}，{1 / 3、18}；

[1001] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、14}，{1 / 3、18}；

[1002] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、13}，{1 / 3、16}，{1 / 3、19}；

[1003] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、12}，{1 / 3、15}，{1 / 3、19}；

[1004] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、13}，{1 / 3、16}，{1 / 3、20}；

[1005] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、12}，{1 / 3、16}，{1 / 3、20}；

[1006] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、14}，{1 / 3、17}，{1 / 3、21}；

[1007] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、13}，{1 / 3、16}，{1 / 3、21}；

[1008] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、14}，{1 / 3、18}，{1 / 3、22}；

[1009] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、13}，{1 / 3、17}，{1 / 3、22}；

[1010] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、15}，{1 / 3、18}，{1 / 3、23}；

[1011] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、11}，{1 / 3、14}，{1 / 3、18}，{1 / 3、23}；

[1012] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、12}，{1 / 3、15}，{1 / 3、19}，{1 / 3、24}；

[1013] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、11}，{1 / 3、14}，{1 / 3、18}，{1 / 3、24}；

[1014] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、13}，{1 / 3、16}，{1 / 3、20}，{1 / 3、25}；

[1015] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、11}，{1 / 3、15}，{1 / 3、19}，{1 / 3、25}；

[1016] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、13}，{1 / 3、16}，{1 / 3、21}，{1 / 3、26}；

[1017] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、12}，{1 / 3、15}，{1 / 3、20}，{1 / 3、26}；

[1018] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、13}，{1 / 3、17}，{1 / 3、21}，{1 / 3、27}；

[1019] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、12}，{1 / 3、16}，{1 / 3、21}，{1 / 3、27}；

[1020] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、14}，{1 / 3、17}，{1 / 3、22}，{1 / 3、28}；

[1021] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、12}，{1 / 3、16}，{1 / 3、21}，{1 / 3、28}；

[1022] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、14}，{1 / 3、18}，{1 / 3、23}，{1 / 3、29}；

[1023] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、10}，{1 / 3、13}，{1 / 3、17}，{1 / 3、22}，{1 / 3、29}；

[1024] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、11}，{1 / 3、15}，{1 / 3、18}，{1 / 3、24}，{1 / 3、30}；

[1025] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、10}，{1 / 3、13}，{1 / 3、17}，{1 / 3、23}，{1 / 3、30}；

[1026] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、12}，{1 / 3、15}，{1 / 3、19}，{1 / 3、24}，{1 / 3、31}；

[1027] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、10}，{1 / 3、13}，{1 / 3、18}，{1 / 3、23}，{1 / 3、31}；

[1028] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、12}，{1 / 3、15}，{1 / 3、20}，{1 / 3、25}，{1 / 3、32}；

[1029] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、10}，{1 / 3、14}，{1 / 3、18}，{1 / 3、24}，{1 / 3、32}；

[1030] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、12}，{1 / 3、16}，{1 / 3、20}，{1 / 3、26}，{1 / 3、33}；

[1031] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、11}，{1 / 3、14}，{1 / 3、19}，{1 / 3、25}，{1 / 3、33}；

[1032] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、12}，{1 / 3、16}，{1 / 3、21}，{1 / 3、26}，{1 / 3、34}；

[1033] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、11}，{1 / 3、14}，{1 / 3、19}，{1 / 3、25}，{1 / 3、34}；

[1034] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、13}，{1 / 3、16}，{1 / 3、21}，{1 / 3、27}，{1 / 3、35}；

[1035] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、11}，{1 / 3、15}，{1 / 3、20}，{1 / 3、26}，{1 / 3、35}；

[1036] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、13}，{1 / 3、17}，{1 / 3、22}，{1 / 3、28}，{1 / 3、36}；

[1037] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、11}，{1 / 3、15}，{1 / 3、20}，{1 / 3、27}，{1 / 3、36}；

[1038] {1、1}，{1 / 3、1}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、8}，{1 / 3、9}，{1 / 3、10}，{1 / 3、13}，{1 / 3、17}，{1 / 3、22}，{1 / 3、29}，{1 / 3、37}；

[1039] {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 2、2}，{1 / 3、2}，{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}，{1 / 3、7}，{1 / 3、9}，{1 / 3、12}，{1 / 3、16}，{1 / 3、21}，{1 / 3、28}，{1 / 3、37}；

[1040] {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 8}, {1 / 3, 9}, {1 / 3, 10}, {1 / 3, 13}, {1 / 3, 17}, {1 / 3, 22}, {1 / 3, 29}, {1 / 3, 38};

[1041] {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 9}, {1 / 3, 12}, {1 / 3, 16}, {1 / 3, 21}, {1 / 3, 28}, {1 / 3, 38};

[1042] {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 8}, {1 / 3, 9}, {1 / 3, 11}, {1 / 3, 14}, {1 / 3, 18}, {1 / 3, 23}, {1 / 3, 30}, {1 / 3, 39};

[1043] {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 9}, {1 / 3, 12}, {1 / 3, 16}, {1 / 3, 22}, {1 / 3, 29}, {1 / 3, 39};

[1044] {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 8}, {1 / 3, 9}, {1 / 3, 11}, {1 / 3, 14}, {1 / 3, 18}, {1 / 3, 24}, {1 / 3, 31}, {1 / 3, 40};

[1045] {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 7}, {1 / 3, 9}, {1 / 3, 12}, {1 / 3, 16}, {1 / 3, 22}, {1 / 3, 30}, {1 / 3, 40}.

[1046] In some embodiments, the number of bits in the bit sequence corresponding to the control information for indicating the combination of the coding rate and the repetition times is determined based on the high-layer control signaling.

[1047] In some embodiments, the minimum number of bits in the bit sequence corresponding to the control information for indicating the combination of the coding rate and the repetition times is one of the following: 1, 2, 3.

[1048] In some embodiments, the maximum number of bits in the bit sequence corresponding to the control information for indicating the combination of the coding rate and the repetition times is one of the following: 3, 4, 5.

[1049] In some embodiments, the coding rate is less than 1.

[1050] In some embodiments, the repetition times are greater than 1.

[1051] It should be noted that if the coding rate is equal to 1, it means that the number of bits in the coded bit sequence output by the convolutional coding is equal to the number of bits in the input information bit sequence. At this time, convolutional coding is not required, that is, the convolutional coding is skipped, and the coded bit sequence is directly equal to the input information bit sequence. And if the repetition times are equal to 1, it means that the repetition operation is not required, and the first sequence is directly equal to the coded bit sequence.

[1052] In some embodiments, the convolutional coding includes three generating polynomials represented in octal: 133, 171, and 165.

[1053] In some embodiments, the control information is further used to determine the number of bits in the information bit sequence.

[1054] In some embodiments, the control information is used to determine the number of bits in the information bit sequence from a first list (or referred to as a transport block size list); the first list includes at least one transport block size.

[1055] In some embodiments, the number of transport block sizes in the first list is one of the following: 8, 16, 32, 64, 128, 256.

[1056] In some embodiments, the largest transport block size in the first list is one of the following: 800, 960, 992, 1000, 1024, 1080, 1200, 1536, 2000, 2048.

[1057] In some embodiments, the smallest transport block size in the first list is one of the following: 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 24, 32.

[1058] In some embodiments, the minimum value of the difference between adjacent transport block sizes in the first list is one of the following: 4, 6, 8, 10, 12, 16, 24, 32.

[1059] In some embodiments, the maximum value among the differences between adjacent transport block sizes in the first list is one of the following: 16, 24, 32, 48, 64, 80, 96, 128, 256, 512.

[1060] In some embodiments, the first list includes transport block sizes of at least one of the following: 8, 16, 20, 24, 32, 56, 64, 88, 96, 104, 128, 256, 400, 512, 1000, 1024.

[1061] In some embodiments, the control information includes at least one of the following: transport block size index, frequency shift factor, number of chips within an orthogonal frequency division multiplexing symbol, chip duration, bit duration, number of repetitions, coding code rate, coding repetition strategy index.

[1062] In some embodiments, the first list is one of the following or one of the following for a target percentage: 1) 8, 16, 32, 64, 128, 256, 512, 1024; 2) 8, 20, 32, 64, 96, 256, 400, 1000; 3) 8, 16, 24, 32, 48, 64, 80, 96, 160, 224, 288, 352, 480, 608, 736, 864; 4) 20, 32, 48, 64, 80, 96, 128, 192, 256, 320, 400, 528, 656, 784, 912, 1000; 5) 20, 32, 48, 64, 80, 96, 128, 192, 256, 320, 400, 528, 656, 784, 912, 1024; 6) 20, 28, 40, 56, 72, 96, 128, 176, 232, 296, 400, 480, 576, 704, 832, 1000; 7) 8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 160, 192, 224, 256, 320, 384, 448, 512, 576, 640, 704, 768, 832, 896, 960, 1024; 8) 8, 16, 20, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 144, 176, 208, 240, 272, 304, 336, 368, 400, 432, 512, 640, 768, 896, 1000;

[1071] 9) 8, 16, 20, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 144, 176, 208, 240, 272, 304, 336, 368, 400, 432, 512, 640, 768, 896, 1024.

[1072] Among them, the target percentage can be: 60%, 70%, 80%, 90% or 95%.

[1073] In some embodiments, the control information is also used to determine the number of bits of the information bit sequence. In some embodiments, the number of bits of the information bit sequence is determined in the following manner: the control information includes an n-bit indication, and the number of bits of the information bit sequence is obtained by calculation using the n bits.

[1074] In some embodiments, an integer factor is determined according to the range of the integer indicated by the n-bit indication, and different integer factors are used in different ranges. There are C integer ranges, corresponding to C integer factors. The number of bits of the information bit sequence is determined according to the control information including the n-bit indication, the C integer ranges, and the C integer factors. Among them, n can be equal to 3, 4, 5, or 6. C can be equal to 2, 3, 4, 5, 6, or 8. Among them, the number of bits of the information bit sequence is equal to a function of the integer indicated by the n-bit indication and the integer factor, where the integer factor is determined according to the C integer ranges based on the integer indicated by the n-bit indication. When the integer ranges are different, the function of the integer indicated by the n-bit indication and the integer factor is different.

[1075] In one example, n is equal to 4, then the integer indicated by the n-bit indication is 0 to 15. There are 3 integer ranges. When the corresponding integer range is 0 to 5, the integer factor is equal to 16; when the corresponding integer range is 6 to 9, the integer factor is equal to 40; when the corresponding integer range is 10 to 15, the integer factor is equal to 64. The integer indicated by the n-bit indication is A. When A is less than or equal to 5, the number of bits of the information bit sequence is equal to (A + 1) * 16; otherwise, when A is less than or equal to 9, the number of bits of the information bit sequence is equal to (A + 1) * 40; otherwise, the number of bits of the information bit sequence is equal to (A + 1) * 64.

[1076] In one example, n is equal to 4, C is equal to 3, then the corresponding integer ranges and integer factors are as shown in Table 38 below:

[1077] Table 38

[1078] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 0～4 5～10 11～15 Integer Factor 8 40 64

[1079] In one example, n is equal to 4, C is equal to 3, then the corresponding integer ranges and integer factors are as shown in Table 39 below:

[1080] Table 39

[1081] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 0～4 5～10 11～15 Integer Factor 8 40 50

[1082] Among them, when A belongs to the integer range 0, the number of bits of the information bit sequence is equal to the function of the integer indicated by the n-bit indication and the integer factor, which is (A + 1) * 8; when A belongs to the integer range 1, the number of bits of the information bit sequence is equal to the function of the integer indicated by the n-bit indication and the integer factor, which is (A + 1) * 40; when A belongs to the integer range 2, the number of bits of the information bit sequence is equal to the function of the integer indicated by the n-bit indication and the integer factor, which is (A + 5) * 50.

[1083] In some embodiments, the integer factors for all integer ranges are equal to positive integer powers of 2. For example, the integer factor is equal to at least one of the following: 8, 16, 32, 64, 128, 256. The advantage of the integer factor being a positive integer power of 2 is that only the integer A indicated by the n-bit indication needs to be shifted to determine the number of bits of the information bit sequence, without multiplication operations, the circuit is simple, resources are saved, the calculation amount is small, and the power consumption is very low. In one example, n is equal to 4 and C is equal to 3, then the corresponding integer ranges and integer factors are as shown in Table 40 below:

[1084] Table 40

[1085] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 0～4 5～10 11～15 Integer Factor 8 32 64

[1086] In one example, n is equal to 4 and C is equal to 3, then the number of bits of the information bit sequence is determined as shown in Table 41 below, where A is the integer indicated by the n-bit indication in the control information.

[1087] Table 41

[1088] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 0～4 5～10 11～15 Integer Factor (A+1)*8 (A+1)*32 (A+1)*64

[1089] In one example, n is equal to 4 and C is equal to 4, then the number of bits of the information bit sequence is determined as shown in Table 42 below, where A is the integer indicated by the n-bit indication in the control information.

[1090] Table 42

[1091] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 3 Integer Range 0～3 4～7 8～11 12～15 Integer Factor (A+1)*8 (A+1)*16 (A+1)*32 (A+1)*64

[1092] In one example, n is equal to 4 and C is equal to 4, then the number of bits of the information bit sequence is determined as shown in Table 43 below, where A is the integer indicated by the n-bit indication in the control information.

[1093] Table 43

[1094] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 3 Integer Range 0～5 6～8 9～11 12～15 Integer Factor (A+1)*8 (A+1)*16 (A+1)*32 (A+1)*64

[1095] In one example, n equals 4 and C equals 4, then the number of bits of the information bit sequence is determined as shown in Table 44 below, where A is the integer indicated by the n-bit indication in the control information.

[1096] Table 44

[1097] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 3 Integer Range 0～5 6～8 9～11 12～15 Integer Factor (A+1)*8 (A+1)*16 (A+1)*32 (A+5)*50

[1098] In one example, n equals 5 and C equals 3, then the number of bits of the information bit sequence is determined as shown in Table 45 below, where A is the integer indicated by the n-bit indication in the control information.

[1099] Table 45

[1100] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 0～10 11～21 22～31 Integer Factor (A+1)*8 (A+1)*16 (A+1)*32

[1101] In one example, n equals 5 and C equals 4, then the number of bits of the information bit sequence is determined as shown in Table 46 below, where A is the integer indicated by the n-bit indication in the control information.

[1102] Table 46

[1103] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 3 Integer Range 0～7 8～15 16～23 24～31 Integer Factor (A+1)*4 (A+1)*8 (A+1)*16 (A+1)*32

[1104] In one example, n equals 5 and C equals 4, then the number of bits of the information bit sequence is determined as shown in Table 47 below, where A is the integer indicated by the n-bit indication in the control information.

[1105] Table 47

[1106] Integer Range 0 Integer Range 1 Integer Range 2 Integer Range 3 Integer Range 0～7 8～15 16～23 24～31 Integer Factor (A+1)*8 (A+1)*12 (A+1)*16 (A+1)*32

[1107] In one example, n equals 5 and C equals 2, then the number of bits of the information bit sequence is determined as shown in Table 48 below, where A is the integer indicated by the n-bit indication in the control information.

[1108] Table 49

[1109] Integer Range 0 Integer Range 1 Integer Range 0～15 16～31 Integer Factor (A+1)*8 (A+1)*32

[1110] In one example, n equals 5 and C equals 2, then the number of bits of the information bit sequence is determined as shown in Table 50 below, where A is the integer indicated by the n-bit indication in the control information.

[1111] Table 50

[1112] Integer Range 0 Integer Range 1 Integer Range 0～23 24～31 Integer Factor (A+1)*8 (A+1)*32

[1113] In one example, n equals 5 and C equals 2, then the number of bits of the information bit sequence is determined as shown in Table 51 below, where A is the integer indicated by the n-bit indication in the control information.

[1114] Table 51

[1115] Integer Range 0 Integer Range 1 Integer Range 0～11 12～31 Integer factor (A+1)*8 (A+1)*32

[1116] In one example, when n is equal to 6 and C is equal to 3, the number of bits of the information bit sequence is determined as shown in Table 52 below, where A is an integer indicated by the n-bit indication in the control information.

[1117] Table 52

[1118] Integer range 0 Integer range 1 Integer range 2 Integer range 0～20 21～43 22～63 Integer factor (A+1)*8 (A+1)*12 (A+1)*16

[1119] In one example, when n is equal to 6 and C is equal to 2, the number of bits of the information bit sequence is determined as shown in Table 53 below, where A is an integer indicated by the n-bit indication in the control information.

[1120] Table 53

[1121] Integer range 0 Integer range 1 Integer range 0～31 32～63 Integer factor (A+1)*8 (A+1)*16

[1122] In some embodiments, processing is performed on the first sequence based on the coding rate and / or the number of repetitions to obtain an information bit sequence, including: performing a derepetition operation on the first sequence based on the number of repetitions to obtain a corresponding coded sequence; performing convolutional decoding on the coded sequence according to the coding rate to obtain a CRC-coded sequence; performing a CRC check on the CRC-coded sequence, and if the check passes, outputting the corresponding information bit sequence, otherwise discarding the received data.

[1123] It should be noted that the explanation of the embodiment of the communication method applied to Figure 1 the second node 102 in the communication system shown can refer to the explanation of the embodiment of the communication method applied to Figure 1 the first node 101 in the communication system shown.

[1124] The disclosed embodiments can divide the communication device into functional modules according to the above method embodiments. For example, each functional module can be divided corresponding to each function, or two or more functions can be integrated into one functional module. The above integrated module can be implemented in the form of hardware or software. It should be noted that the division of modules in the disclosed embodiments is illustrative, only a logical function division, and there can be other division methods in actual implementation. The following takes the example of dividing each functional module corresponding to each function for illustration.

[1125] Figure 12 is a schematic structural diagram of another communication device provided by the disclosed embodiments, and the communication device can execute the communication method provided by the above method embodiments. As Figure 12As shown in the figure, the communication device includes: a receiving module 1201, a processing module 1202, and a transmitting module 1203.

[1126] The receiving module 1201 is configured to receive control information from a second node;

[1127] The processing module 1202 is configured to determine an encoding code rate and / or a repetition number based on the control information;

[1128] The processing module 1202 is further configured to generate a first sequence based on the information bit sequence, as well as the encoding code rate and / or the repetition number;

[1129] The transmitting module 1203 is configured to transmit the first sequence to the second node.

[1130] In some embodiments, the encoding code rate is used to perform encoding on the information bit sequence to obtain an encoded bit sequence.

[1131] In some embodiments, the repetition number is used to perform a repetition process on the encoded bit sequence to obtain the first sequence.

[1132] In some embodiments, the encoding code rate includes at least one of the following: 1, 8 / 9, 7 / 8, 6 / 7, 5 / 6, 4 / 5, 3 / 4, 2 / 3, 3 / 5, 5 / 8, 1 / 2, 1 / 3.

[1133] In some embodiments, the repetition number includes at least one of the following: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 22, 24, 32, 36, 40, 48, 56, 64.

[1134] In some embodiments, the processing module 1202 is specifically configured to determine the encoding code rate and the repetition number from a parameter list based on the control information; the parameter list includes N candidate combinations, and one candidate combination includes a candidate encoding code rate and a candidate repetition number, where N is a positive integer.

[1135] In some embodiments, the control information is carried on a bit sequence, and the bit sequence includes n bits for indicating one candidate combination or a candidate combination index in the parameter list, where 2 to the power of n is equal to N, and n is a positive integer.

[1136] In some embodiments, n is 1, and the parameter list is one of the following:

[1137] {1, 1}, {1 / 3, 2}; {1, 1}, {1 / 3, 3}; {1, 1}, {1 / 3, 4}; {1, 1}, {1 / 3, 5}; {1, 1}, {1 / 3, 6}; {1, 1}, {1 / 3, 8}; {1, 1}, {1 / 3, 10}; {1, 1}, {1 / 3, 12}; {1, 1}, {1 / 3, 16}; {1, 1}, {1 / 3, 24}; {1, 1}, {1 / 3, 32}; {1, 1}, {1 / 3, 48}.

[1138] In some embodiments, n is 2, and the parameter list is one of the following: {1, 1}, {1 / 2, 1}, {1 / 3, 2}, {1 / 3, 6}; {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 6}; {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}; {1, 1}, {1 / 3, 1}, {1 / 3, 4}, {1 / 3, 16}; {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 24}; {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 25}; {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 23}.

[1139] In some embodiments, n is 3, and the parameter list is one of the following:

[1140] {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}, {1 / 3, 32};

[1141] {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 4}, {1 / 3, 8}, {1 / 3, 16}, {1 / 3, 32}.

[1142] In some embodiments, n is 4, and the parameter list is one of the following:

[1143] {1, 1}, {1 / 2, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 8}, {1 / 3, 10}, {1 / 3, 13}, {1 / 3, 16}, {1 / 3, 20}, {1 / 3, 25}, {1 / 3, 32}, {1 / 3, 40};

[1144] {1, 1}, {1 / 2, 1}, {1 / 2, 2}, {1 / 3, 2}, {1 / 3, 3}, {1 / 3, 4}, {1 / 3, 5}, {1 / 3, 6}, {1 / 3, 8}, {1 / 3, 10}, {1 / 3, 13}, {1 / 3, 16}, {1 / 3, 20}, {1 / 3, 25}, {1 / 3, 32}, {1 / 3, 40}.

[1145] In some embodiments, the control information determines a combination including a coding rate and a repetition count, and all the combinations form a parameter list: {1, 1}, {R, 1}, {1 / 3, 1}, {1 / 3, E}, where R is a real number greater than 1 / 3 and less than 1, and E is an integer greater than 1 and less than or equal to 64.

[1146] In a specific example, the R is equal to 2 / 3, 3 / 4, 4 / 5, 3 / 5, 2 / 5, 5 / 6, 6 / 7, 5 / 7, 4 / 7, 3 / 7, 7 / 8, 5 / 8, 3 / 8, 8 / 9, 7 / 9, 5 / 9, 4 / 9, 9 / 10, 7 / 10, 4 / 10 or 1 / 2.

[1147] In a specific example, the E is equal to 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 22, 24, 32, 36, 40, 48, 56 or 64.

[1148] In some embodiments, the control information determines a combination including a coding rate and a repetition count, and all the combinations form a parameter list: {1, 1}, {R0, 1}, {R1, 1}, {1 / 3, 1}, {1 / 3, E0}, {1 / 3, E1}, {1 / 3, E2}, {1 / 3, E3}, where R0 and R1 are both real numbers greater than 1 / 3 and less than 1, and E0, E1, E2, and E3 are integers greater than 1 and less than or equal to 64 respectively. In a specific example, the R0 and R1 are respectively equal to 2 / 3, 3 / 4, 4 / 5, 3 / 5, 2 / 5, 5 / 6, 6 / 7, 5 / 7, 4 / 7, 3 / 7, 7 / 8, 5 / 8, 3 / 8, 8 / 9, 7 / 9, 5 / 9, 4 / 9, 9 / 10, 7 / 10, 4 / 10 or 1 / 2. In another specific example, the E0, E1, E2, and E3 are respectively equal to 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 22, 24, 32, 36, 40, 48, 56 or 64.

[1149] In some embodiments, the number of bits in the bit sequence corresponding to the control information for indicating the combination of the coding rate and the repetition count is determined based on high-layer control signaling.

[1150] In some embodiments, the minimum number of bits in the bit sequence corresponding to the control information for indicating the combination of the coding rate and the number of repetitions is one of the following: 1, 2, 3.

[1151] In some embodiments, the maximum number of bits in the bit sequence corresponding to the control information for indicating the combination of the coding rate and the number of repetitions is one of the following: 3, 4, 5.

[1152] In some embodiments, the coding rate is less than 1.

[1153] In some embodiments, the number of repetitions is greater than 1.

[1154] In some embodiments, the control information is further used to determine the number of bits of the information bit sequence.

[1155] In some embodiments, the number of bits of the information bit sequence is determined in the following manner:

[1156] Based on the control information, determine the number of bits of the information bit sequence from a first list; the first list includes at least one transport block size.

[1157] In some embodiments, the number of transport block sizes in the first list is one of the following: 8, 16, 32, 64, 128, 256.

[1158] In some embodiments, the largest transport block size in the first list is one of the following: 800, 960, 992, 1000, 1024, 1080, 1200, 1536, 2000, 2048.

[1159] In some embodiments, the smallest transport block size in the first list is one of the following: 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 24, 32.

[1160] In some embodiments, the minimum value of the differences between adjacent transport block sizes in the first list is one of the following: 4, 6, 8, 10, 12, 16, 24, 32.

[1161] In some embodiments, the maximum value of the differences between adjacent transport block sizes in the first list is one of the following: 16, 24, 32, 48, 64, 80, 96, 128, 256, 512.

[1162] In some embodiments, the first list includes the transport block sizes of at least one of the following: 8, 16, 20, 24, 32, 56, 64, 88, 96, 104, 128, 256, 400, 512, 1000, 1024.

[1163] In some embodiments, the transport block size list includes an integer sequence sorted from smallest to largest.

[1164] In some embodiments, in the transport block size list, it includes: within the range from K0 to K1, at least H integer values, where the difference between any two adjacent integer values within this range is equal, H is an integer greater than 2, and both K0 and K1 are positive integers and K1 is greater than K0. In one example, K0 is equal to at least one of the following: 4, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 22, 24, 32, 64, 88, 96, 104, 120, 128, 136, 240, 256, 272, 392, 400, 408, 512, 768. In one example, K1 is equal to at least one of the following: 64, 88, 96, 104, 120, 128, 136, 240, 256, 272, 392, 400, 408, 512, 768, 960, 1000, 1024, 1080, 1088.

[1165] In a specific example, K0 is equal to 8 and K1 is equal to 96. In another specific example, K0 is equal to 96 and K1 is equal to 400. In another specific example, K0 is equal to 400 and K1 is equal to 1000. In another specific example, K0 is equal to 400 and K1 is equal to 1000. In one example, K0 = 8, K1 = 96, and H is equal to 12, where the difference between two adjacent integer values is equal to 8. In another example, K0 = 96, K1 = 384, and H is equal to 9, where the difference between two adjacent integer values is equal to 32. In another example, K0 = 384, K1 = 1088, and H is equal to 11, where the difference between two adjacent integer values is equal to 64.

[1166] In some embodiments, in the transport block size list, it includes integer values in a first range and integer values in a second range. The integer values in the first range are less than the integer values in the second range. The first difference between any adjacent integer values in the first range is equal. The second difference between any adjacent integer values in the second range is equal. The first difference is less than the second difference. In a specific example, the second difference is equal to C times the first difference, where C is equal to 1.5, 2, 2.5, 3, 4, or 5. In a specific example, the integer values in the first range include one or more of the following integers: 6, 8, 10, 12, 14, 16, 18, 20, 24, 32, 40, 88, 96, 104, 112, 128, 200, 240, 256, 272, 384, 400, 408, 512. In a specific example, the integer values in the second range include one or more of the following integers: 96, 104, 112, 128, 200, 240, 256, 272, 384, 400, 408, 512, 768, 888, 960, 1000, 1008, 1024, 1080, 1088.

[1167] In some embodiments, in the transport block size list, it includes integer values in a first range, integer values in a second range, and integer values in a third range. The integer values in the first range are less than the integer values in the second range. The integer values in the second range are less than the integer values in the third range. The first difference between any adjacent integer values in the first range is equal. The second difference between any adjacent integer values in the second range is equal. The third difference between any adjacent integer values in the third range is equal. The first difference is less than the second difference. The second difference is less than the third difference. In a specific example, the second difference is equal to C1 times the first difference, where C1 is equal to 1.5, 2, 2.5, 3, 4, or 5. In a specific example, the third difference is equal to C2 times the second difference, where C2 is equal to 1.5, 2, 2.5, 3, 4, or 5. In a specific example, the integer values in the first range include one or more of the following integers: 6, 8, 10, 12, 14, 16, 18, 20, 24, 32, 40, 88, 96, 104, 112, 128, 256. In a specific example, the integer values in the second range include one or more of the following integers: 96, 104, 112, 128, 200, 240, 256, 272, 384, 400, 408, 512, 768. In a specific example, the integer values in the third range include one or more of the following integers: 400, 408, 512, 768, 888, 960, 1000, 1008, 1024, 1080, 1088.

[1168] In some embodiments, in the transport block size list, integer values in a first range, integer values in a second range, integer values in a third range, and integer values in a fourth range are included. The integer values in the first range are less than the integer values in the second range, the integer values in the second range are less than the integer values in the third range, the integer values in the second range are less than the integer values in the fourth range. The first difference between any adjacent integer values in the first range is equal, the second difference between any adjacent integer values in the second range is equal, the third difference between any adjacent integer values in the third range is equal, the fourth difference between any adjacent integer values in the fourth range is equal. The first difference is less than the second difference, the second difference is less than the third difference, and the third difference is less than the fourth difference. In a specific example, the second difference is equal to C1 times the first difference, where C1 is equal to 1.5, 2, 2.5, 3, 4, or 5. In a specific example, the third difference is equal to C2 times the second difference, where C2 is equal to 1.5, 2, 2.5, 3, 4, or 5. In a specific example, the fourth difference is equal to C3 times the third difference, where C3 is equal to 1.5, 2, 2.5, 3, 4, or 5. In a specific example, the integer values in the first range include one or more of the following integers: 6, 8, 10, 12, 14, 16, 18, 20, 24, 32, 36, 40. In a specific example, the integer values in the second range include one or more of the following integers: 88, 96, 104, 112, 128, 136, 200, 240, 256, 272, 384, 392, 400, 408. In a specific example, the integer values in the third range include one or more of the following integers: 384, 392, 400, 408, 504, 512, 520, 600, 768. In a specific example, the integer values in the fourth range include one or more of the following integers: 400, 408, 512, 768, 888, 960, 1000, 1008, 1024, 1080, 1088.

[1169] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 8, 20, 32, 64, 96, 256, 400, 1000.

[1170] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 20, 32, 64, 96, 256, 400, 768, 1000.

[1171] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 16, 32, 64, 96, 256, 400, 768, 1000.

[1172] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 12, 32, 64, 96, 256, 400, 768, 1000.

[1173] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 16, 32, 64, 96, 248, 400, 1024.

[1174] In some embodiments, all elements in the transport block size list are equal to all of the following values or are values that are a target percentage: 8, 16, 32, 64, 96, 248, 400, 1024.

[1175] In some embodiments, all elements in the transport block size list are equal to all of the following values or are values that are a target percentage: 8, 16, 32, 48, 64, 80, 96, 192, 288, 400, 608, 816, 1024.

[1176] In some embodiments, all elements in the transport block size list are equal to all of the following values or are values that are a target percentage: 8, 16, 32, 48, 64, 80, 96, 192, 288, 400, 560, 720, 880, 1024.

[1177] In some embodiments, all elements in the transport block size list are equal to all of the following values or are values that are a target percentage: 8, 16, 24, 32, 48, 64, 80, 96, 192, 288, 400, 560, 720, 880, 1024.

[1178] In some embodiments, all elements in the transport block size list are equal to all of the following values or are values that are a target percentage: 8, 16, 24, 32, 40, 48, 64, 80, 96, 192, 288, 400, 608, 816, 1024.

[1179] In some embodiments, all elements in the transport block size list are equal to all of the following values or are values that are a target percentage: 8, 16, 32, 48, 64, 80, 96, 144, 192, 240, 288, 400, 608, 816, 1024.

[1180] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 10, 42, 74, 106, 256, 512, 768, 1024.

[1181] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 40, 72, 104, 256, 512, 768, 1024.

[1182] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 16, 48, 80, 112, 256, 512, 768, 1024.

[1183] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 16, 80, 144, 208, 256, 512, 768, 1024.

[1184] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 16, 80, 144, 208, 232, 488, 744, 1000.

[1185] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 72, 136, 200, 232, 488, 744, 1000.

[1186] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 4, 68, 132, 196, 232, 488, 744, 1000.

[1187] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 136, 264, 392, 512, 656, 800, 944.

[1188] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 10, 138, 266, 394, 512, 664, 816, 968.

[1189] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 16, 144, 272, 400, 512, 672, 832, 992.

[1190] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 136, 264, 392, 512, 680, 848, 1016.

[1191] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 150, 274, 398, 522, 646, 770, 1000.

[1192] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 16, 160, 304, 448, 592, 736, 880, 1000.

[1193] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 12, 156, 300, 444, 588, 732, 876, 1000.

[1194] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 20, 32, 48, 64, 80, 96, 128, 192, 256, 320, 400, 528, 656, 784, 912, 1000.

[1195] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 43, 78, 113, 148, 183, 218, 253, 349, 442, 535, 628, 721, 814, 907, 1000.

[1196] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 40, 72, 104, 136, 168, 200, 232, 352, 448, 544, 640, 736, 832, 928, 1024.

[1197] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 40, 72, 104, 136, 168, 200, 232, 352, 448, 544, 640, 736, 832, 928, 1000.

[1198] In some embodiments, all elements in the first list are equal to all of the following values or are values that are a target percentage: 8, 32, 56, 80, 104, 128, 216, 304, 392, 480, 568, 656, 744, 832, 920, 1008.

[1199] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 8, 32, 56, 80, 104, 128, 216, 304, 392, 480, 568, 656, 744, 832, 920, 1000.

[1200] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 8, 24, 40, 56, 72, 88, 184, 272, 360, 448, 536, 624, 712, 800, 888, 976.

[1201] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 8, 24, 40, 56, 72, 88, 184, 272, 360, 448, 536, 624, 712, 800, 888, 1000.

[1202] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 8, 48, 88, 128, 168, 208, 248, 288, 328, 368, 504, 608, 712, 816, 920, 1024.

[1203] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 8, 40, 72, 104, 136, 168, 200, 232, 264, 296, 420, 540, 660, 780, 900, 1000.

[1204] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 8, 40, 72, 104, 136, 168, 200, 288, 376, 464, 552, 640, 728, 816, 904, 992.

[1205] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 16, 48, 80, 112, 144, 176, 280, 360, 440, 520, 600, 680, 760, 840, 920, 1000.

[1206] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 8, 24, 40, 56, 72, 88, 136, 200, 264, 328, 392, 520, 640, 760, 880, 1000.

[1207] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 8, 24, 40, 56, 72, 88, 96, 160, 224, 288, 352, 504, 608, 712, 816, 920.

[1208] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 8, 16, 20, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 144, 176, 208, 240, 272, 304, 336, 368, 400, 432, 512, 640, 768, 896, 1000.

[1209] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 128, 160, 192, 224, 256, 288, 320, 352, 384, 456, 512, 568, 624, 680, 736, 792, 848, 904, 960, 1016.

[1210] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 128, 160, 192, 224, 256, 288, 320, 352, 384, 440, 496, 552, 608, 664, 720, 776, 832, 888, 944, 1000.

[1211] In some embodiments, all elements in the first list are equal to all of the following values or are values of a target percentage: 8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 144, 176, 208, 240, 272, 304, 336, 368, 400, 440, 496, 552, 608, 664, 720, 776, 832, 888, 944, 1000.

[1212] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 144, 176, 208, 240, 272, 304, 336, 368, 400, 464, 520, 576, 632, 688, 744, 800, 856, 912, 968, 1024.

[1213] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 104, 144, 176, 208, 240, 272, 304, 336, 368, 400, 464, 520, 576, 632, 688, 744, 800, 856, 912, 968, 1024.

[1214] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 12, 20, 28, 36, 44, 52, 60, 68, 76, 84, 92, 100, 144, 176, 208, 240, 272, 304, 336, 368, 400, 464, 520, 576, 632, 688, 744, 800, 856, 912, 968, 1024.

[1215] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 6, 14, 22, 30, 38, 46, 54, 62, 70, 78, 86, 94, 144, 176, 208, 240, 272, 304, 336, 368, 400, 464, 520, 576, 632, 688, 744, 800, 856, 912, 968, 1024.

[1216] In some embodiments, all elements in the first list are equal to all of the following values or values that are a target percentage: 10, 18, 26, 34, 42, 50, 58, 66, 74, 82, 90, 98, 144, 176, 208, 240, 272, 304, 336, 368, 400, 464, 520, 576, 632, 688, 744, 800, 856, 912, 968, 1024.

[1217] Wherein, the target percentage can be equal to: 60%, 70%, 80%, 90% or 95%.

[1218] In some embodiments, the control information includes at least one of the following: transport block size index, frequency shift factor, number of chips within an orthogonal frequency division multiplexing symbol, chip duration, bit duration, number of repetitions, coding code rate, coding repetition strategy index. Among them, the transport block size index is used to determine a transport block size in a first list, that is, the number of bits corresponding to the information bit sequence. The frequency shift factor is used to indicate the amount of frequency offset for data transmission. The larger the frequency shift factor, the larger the offset. Different user equipments adopt different frequency shift factors, which can minimize the spectral aliasing between them. The number of chips within an orthogonal frequency division multiplexing symbol refers to the number of levels included in a transmitted orthogonal frequency division multiplexing symbol. The chip duration is the duration of one level. The bit duration is the transmission duration of information bits or coded bits.

[1219] In one example, a communication method for a second node is provided. The communication method includes the following steps:

[1220] Step 1: Send control information to a first node. The control information includes at least the transport block size index, which is used to determine the transport block size.

[1221] Step 2: Receive a first sequence sent by the first node.

[1222] Step 3: Process the first sequence based on the transport block size to obtain an information bit sequence.

[1223] Among them, the transport block size index is located at the forefront of the control information. For example, the control information is carried on a bit sequence, and the transport block size index is in the first n bits of the bit sequence, where n is the number of bits used to carry the transport block size index. The beneficial effect of such an operation is that it is convenient for the first node (user equipment or tag equipment) to immediately know the number of bits of the data to be sent to the second node (such as a base station or a reader) when receiving the first n bits. The first node (user equipment or tag equipment) can pre-read the corresponding information bit sequence to calculate the check bits of the cyclic redundancy check (CRC), thereby reducing the waiting time between CRC calculation and convolutional coding calculation, and thus saving data waiting and improving the efficiency of data processing.

[1224] In some embodiments, processing the first sequence based on the transport block size to obtain an information bit sequence includes: performing a derepetition operation on the first sequence to obtain a corresponding coded sequence; then, performing convolutional decoding on the coded sequence to obtain a CRC coded sequence; performing CRC check on the CRC coded sequence. If the check passes, the corresponding information bit sequence is output, otherwise the received data is discarded.

[1225] In some embodiments, a CRC check is performed on the CRC-encoded sequence, where the CRC generating polynomial is at least one of the following: g CRC6 (D) = [D 6 + D 5 + 1], g CRC16 (D) = [D 16 + D 12 + D 5 + 1]. Among them, the CRC check bits corresponding to the two generating polynomials are 6 bits and 16 bits respectively.

[1226] In another example, a communication method for a second node is provided. The communication method includes the following steps:

[1227] Step 1: Send control information to the first node. The control information includes at least a transport block size index and a data storage start position. The transport block size index is used to determine the transport block size.

[1228] Step 2: Receive a first sequence sent by the first node.

[1229] Step 3: Process the first sequence based on the transport block size to obtain an information bit sequence.

[1230] Among them, the transport block size index and the data storage start position are at the forefront of the control information. For example, the control information is carried on a bit sequence, and the transport block size index and the data storage start position are in the first n + m bits of the bit sequence, where n is the number of bits used to carry the transport block size index and m is the number of bits used to carry the data storage start position. In a specific example, the transport block size index is at the forefront of the control information bit sequence, including n bits; the data storage start position is adjacent to and after the transport block size index in the control information bit sequence. Or, the data storage start position is at the forefront of the control information bit sequence, adjacent to and followed by the transport block size index.

[1231] The information bit sequence is determined according to the data storage start position and the transport block size index. For example, it is read starting from the data storage start position, and the number of bits read is determined by the transport block size index.

[1232] In another example, a communication method for a second node is provided. The communication method includes the following steps:

[1233] Step 1: Send control information to the first node. The control information includes at least a transport block size index and a message type. The transport block size index is used to determine the transport block size.

[1234] Step 2: Receive a first sequence sent by the first node.

[1235] Step 3: Process the first sequence based on the transport block size to obtain an information bit sequence.

[1236] Among them, the transport block size index and the message type are at the forefront of the control information. For example, the control information is carried on a bit sequence, and the transport block size index and the message type are in the first n + v bits of the bit sequence, where n is the number of bits used to carry the transport block size index and v is the number of bits used to carry the message type. In a specific example, the transport block size index is at the forefront of the control information bit sequence and includes n bits; the message type is adjacent to and after the transport block size index in the control information bit sequence. Alternatively, the message type is at the forefront of the control information bit sequence, adjacent to and followed by the transport block size index.

[1237] In another example, a communication method for a second node is given. This communication method includes the following steps:

[1238] Step 1: Send first control information to the first node, where the first control information includes at least the message type.

[1239] Step 2: Send second control information to the first node, where the second control information includes at least the transport block size index, and this transport block size index is used to determine the transport block size.

[1240] Step 3: Receive the first sequence sent by the first node.

[1241] Step 4: Process the first sequence based on the transport block size to obtain an information bit sequence.

[1242] Among them, the message type is at the forefront of the first control information. For example, the first control information is carried on a bit sequence, and the message type is in the first v bits of the bit sequence, where v is the number of bits used to carry the message type.

[1243] Among them, the transport block size index is at the forefront of the second control information. For example, the second control information is carried on a bit sequence, and the transport block size index is in the first n bits of the bit sequence, where n is the number of bits used to carry the transport block size index.

[1244] The first node (user equipment or tag equipment) can, when obtaining the transport block size index, determine whether the information belongs to itself according to the message type. If not, it can ignore the indication of the transport block size index. When it is determined that the information belongs to itself according to the message type, the transport block size can be determined according to the transport block size index.

[1245] Figure 13 Figure 13 is a schematic structural diagram of another communication device provided by an embodiment of the present disclosure. The communication device can execute the communication method provided by the above method embodiment. As Figure 13 shown, the communication device includes: a sending module 1301, a receiving module 1302, and a processing module 1303.

[1246] The sending module 1301 is configured to send control information to a first node, where the control information is used to determine a coding rate and / or a repetition number;

[1247] The receiving module 1302 is configured to receive a first sequence sent by the first node;

[1248] The processing module 1303 is configured to perform processing on the first sequence based on the coding rate and / or the repetition number to obtain an information bit sequence.

[1249] In the case where the functions of the above integrated modules are implemented in the form of hardware, an embodiment of the present disclosure provides another possible structure of the communication device involved in the above embodiment. As Figure 14 shown, the communication device includes: a processor 1402, a bus 1404. Optionally, the communication device may further include a memory 1401; optionally, the communication device may further include a communication interface 1403.

[1250] The processor 1402 may be used to implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with the embodiments of the present disclosure. The processor 1402 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array, or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It can implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with the embodiments of the present disclosure. The processor 1402 may also be a combination that implements a computing function, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, etc.

[1251] The communication interface 1403 is configured to connect to other devices through a communication network. The communication network may be an Ethernet, a radio access network, a wireless local area network (WLAN), etc.

[1252] The memory 1401 can be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM) or other types of dynamic storage devices that can store information and instructions, or can also be an electrically erasable programmable read-only memory (EEPROM), a magnetic disk storage medium, or other magnetic storage devices, or any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[1253] As a possible implementation, the memory 1401 can exist independently of the processor 1402. The memory 1401 can be connected to the processor 1402 through the bus 1404 for storing instructions or program code. When the processor 1402 calls and executes the instructions or program code stored in the memory 1401, the method provided by the embodiments of the present disclosure can be implemented.

[1254] In another possible implementation, the memory 1401 can also be integrated with the processor 1402.

[1255] The bus 1404 can be an extended industry standard architecture (EISA) bus, etc. The bus 1404 can be divided into an address bus, a data bus, a control bus, etc. For the sake of convenience of representation, Figure 14 only a thick line is used to represent it in the figure, but it does not mean that there is only one bus or one type of bus.

[1256] Some embodiments of the present disclosure provide a computer-readable storage medium (for example, a non-transitory computer-readable storage medium). Computer program instructions are stored in the computer-readable storage medium. When the computer program instructions run on a computer, the computer is caused to execute the method described in any one of the above embodiments.

[1257] Exemplarily, the above computer-readable storage medium may include, but is not limited to: magnetic storage devices (such as hard disks, floppy disks, or magnetic tapes, etc.), optical discs (such as Compact Discs (CDs), Digital Versatile Discs (DVDs), etc.), smart cards, and flash memory devices (such as Erasable Programmable Read-Only Memories (EPROMs), cards, sticks, or key drives, etc.). The various computer-readable storage media described in this disclosure may represent one or more devices and / or other machine-readable storage media for storing information. The term "machine-readable storage medium" may include, but is not limited to, wireless channels and various other media capable of storing, containing, and / or carrying instructions and / or data).

[1258] Embodiments of this disclosure provide a computer program product containing instructions that, when the computer program product runs on a computer, cause the computer to execute the method described in any one of the above embodiments.

[1259] As described above, the above are only the specific embodiments of this disclosure, but the protection scope of this disclosure is not limited thereto. Any changes or substitutions within the technical scope disclosed in this disclosure should be covered by the protection scope of this disclosure. Therefore, the protection scope of this disclosure should be subject to the protection scope of the claims.

Claims

1. A communication method, characterized in that: Applied to the first node, the method comprises: receiving control information from a second node; Determine a coding rate and / or a number of repetitions based on the control information; Generate a first sequence based on the information bit sequence, the encoding rate and / or the number of repetitions; The first sequence is sent to the second node.

2. The method according to claim 1, characterized in that The encoding code rate is used to encode the information bit sequence to obtain an encoded bit sequence.

3. The method according to claim 1, characterized in that The number of repetitions is used to perform repetitive processing on the encoded bit sequence to obtain the first sequence.

4. The method according to claim 1, characterized in that: The encoding bit rate includes at least one of the following: 1, 8 / 9, 7 / 8, 6 / 7, 5 / 6, 4 / 5, 3 / 4, 2 / 3, 3 / 5, 5 / 8, 1 / 2, 1 / 3.

5. The method according to claim 1, characterized in that The number of repetitions includes at least one of the following: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 22, 24, 32, 36, 40, 48, 56, 64.

6. The method according to claim 1, characterized in that Based on the control information, determining the encoding rate and the number of repetitions includes: The coding rate and the number of repetitions are determined from a parameter list based on the control information; the parameter list includes N candidate combinations, one candidate combination includes a candidate coding rate and a candidate number of repetitions, and N is a positive integer.

7. The method according to claim 6, characterized in that The control information is carried on a bit sequence, and the bit sequence includes n bits for indicating a candidate combination or a candidate combination index in the parameter list, where 2 to the power of n is equal to N, and n is a positive integer.

8. The method according to claim 7, characterized in that The n is 1, and the parameter list is one of the following: {1、1}，{1 / 3、1}；{1、1}，{1 / 3、2}；{1、1}，{1 / 3、3}；{1、1}，{1 / 3、4}；{1、1}，{1 / 3、5}；{1、1}，{1 / 3、6}；{1、1}，{1 / 3、8}；{1、1}，{1 / 3、10}；{1、1}，{1 / 3、12}；{1、1}，{1 / 3、16}；{1、1}，{1 / 3、24}；{1、1}，{1 / 3、32}；{1、1}，{1 / 3、48}。 9. The method according to claim 7, characterized in that: The n is 2, and the parameter list is one of the following: {1, 1}, {1 / 2, 1}, {1 / 3, 2}, {1 / 3, 6}; {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 6}; {1, 1}, {1 / 3, 1}, {1 / 3, 2}, {1 / 3, 4}; {1, 1}, {1 / 3, 1}, {1 / 3, 4}, {1 / 3, 16}; {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 24}; {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 25}; {1, 1}, {1 / 2, 1}, {1 / 3, 4}, {1 / 3, 23}.

10. The method according to claim 7, characterized in that The n is 3, and the parameter list is one of the following: {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、4}，{1 / 3、8}，{1 / 3、16}，{1 / 3、32}； {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}、{1 / 3、4}，{1 / 3、8}，{1 / 3、16}，{1 / 3、32}。 11. The method according to claim 7, characterized in that The n is 4, and the parameter list is one of the following: {1、1}，{1 / 2、1}，{1 / 3、1}，{1 / 3、2}、{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}、{1 / 3、8}，{1 / 3、10}，{1 / 3、13}，{1 / 3、16}、{1 / 3、20}，{1 / 3、25}，{1 / 3、32}，{1 / 3、40}； {1、1}，{1 / 2、1}，{1 / 2、2}，{1 / 3、2}、{1 / 3、3}，{1 / 3、4}，{1 / 3、5}，{1 / 3、6}、{1 / 3、8}，{1 / 3、10}，{1 / 3、13}，{1 / 3、16}、{1 / 3、20}，{1 / 3、25}，{1 / 3、32}，{1 / 3、40}。 12. The method according to claim 1, characterized in that The number of bits used to indicate the combination of the coding rate and the number of repetitions in the bit sequence corresponding to the control information is determined based on high-level control signaling.

13. The method according to claim 1, characterized in that The minimum value of the number of bits used to indicate the combination of the coding rate and the number of repetitions in the bit sequence corresponding to the control information is one of the following: 1, 2, 3.

14. The method according to claim 1, characterized in that The maximum value of the number of bits used to indicate the combination of the coding rate and the number of repetitions in the bit sequence corresponding to the control information is one of the following: 3, 4, 5.

15. The method according to claim 1, characterized in that The encoding bit rate is less than 1.

16. The method according to claim 1, characterized in that The number of repetitions is greater than 1.

17. The method according to claim 1, characterized in that The control information is also used to determine the number of bits of the information bit sequence.

18. The method according to claim 17, characterized in that The number of bits of the information bit sequence is determined by: The number of bits of the information bit sequence is determined from a first list based on the control information; the first list includes at least one transport block size.

19. The method according to claim 18, characterized in that The number of transport block sizes in the first list is one of the following: 8, 16, 32, 64, 128, 256.

20. The method according to claim 18, characterized in that The largest transport block size in the first list is one of the following: 800, 960, 992, 1000, 1024, 1080, 1200, 1536, 2000, 2048.

21. The method according to claim 18, characterized in that The smallest transport block size in the first list is one of the following: 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 24, 32.

22. The method according to claim 18, characterized in that The minimum value of the differences between adjacent transport block sizes in the first list is one of the following: 4, 6, 8, 10, 12, 16, 24, 32.

23. The method according to claim 18, characterized in that The maximum value of the differences between adjacent transport block sizes in the first list is one of the following: 16, 24, 32, 48, 64, 80, 96, 128, 256, 512.

24. The method according to claim 18, characterized in that The first list includes at least one of the following transport block sizes: 8, 16, 20, 24, 32, 56, 64, 88, 96, 104, 128, 256, 400, 512, 1000, 1024.

25. The method according to claim 1, characterized in that The control information includes at least one of the following: a transmission block size index, a frequency shift factor, the number of chips in an orthogonal frequency division multiplexing symbol, a chip duration, a bit duration, the number of repetitions, the coding rate, and a coding repetition strategy index.

26. A communication method, characterized in that: Applied to the second node, the method comprises: Sending control information to the first node, where the control information is used to determine a coding rate and / or a number of repetitions; receiving a first sequence sent by the first node; The first sequence is processed based on the encoding code rate and / or the number of repetitions to obtain an information bit sequence.

27. A communication device, characterized in that: include: Memory and processor; Memory and processor coupling; The memory is used to store instructions executable by the processor; When the processor executes the instructions, the processor performs the method according to any one of claims 1 to 25, or the method according to claim 26.

28. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and when the computer instructions are executed on a computer, the computer executes the method according to any one of claims 1 to 25, or executes the method according to claim 26.

29. A computer program product, characterized in that The computer program product comprises computer program instructions, and when the computer program instructions are executed by a processor, the method according to any one of claims 1 to 25 is implemented, or the method according to claim 26 is implemented.

Images