Channel coding method based on binary sequence and related device

Abstract

The embodiment of the invention discloses a channel coding method based on a binary sequence and a related device, and the method comprises the steps: obtaining to-be-transmitted target data, and receiving an expansion frequency and an irreducible polynomial of a base domain; determining a minimum polynomial of a binary sequence according to the expansion times of the base domain and the irreducible polynomial; determining a generator polynomial of a cyclic code according to the minimum polynomial, and generating the cyclic code according to the generator polynomial; and performing channel coding on the target data according to the cyclic code. According to the embodiment of the invention, the reliability and anti-interference performance of channel transmission can be improved.

Description

Technical Field

[0001] The present invention relates to the field of electronic communication technology, and in particular to a channel coding method based on binary sequence and related devices. Background Art

[0002] Channel coding refers to a coding technique that mainly selects specific code types and coding rules to encode the data to be transmitted, so that it can detect errors caused by the transmission channel and even correct transmission errors. Generally, the better the error detection or correction effect, the higher the cost of the coding algorithm. Therefore, channel coding is often a balanced compromise between coding cost and performance. In digital communications, channel coding can improve the reliability and anti-interference of channel transmission by encoding the original data. Summary of the invention

[0003] The embodiments of the present application provide a binary sequence-based channel coding method and related devices, which can improve the reliability and anti-interference performance of channel transmission.

[0004] A first aspect of an embodiment of the present application provides a channel coding method based on a binary sequence, the method comprising: Obtaining target data to be transmitted, and receiving the expansion degree and irreducible polynomial of the base domain; Determine a minimal polynomial of a binary sequence according to the expansion order of the base domain and the irreducible polynomial; Determining a generator polynomial of a cyclic code according to the minimal polynomial, and generating the cyclic code according to the generator polynomial; The target data is channel-coded according to the cyclic code.

[0005] Optionally, determining the minimal polynomial of the binary sequence according to the expansion times of the base domain and the irreducible polynomial includes: Determine the extended domain according to the expansion times of the base domain and the irreducible polynomial; Determining a generator of the extended domain; Determine a target polynomial about a generator according to the generator and the irreducible polynomial; Determine an element in a binary sequence according to the trace of the target polynomial from the extended field to the base field; Determine the definition set of minimal polynomials based on the elements in the binary sequence; The minimal polynomial is determined according to the definition set and a general formula of the minimal polynomial.

[0006] Optionally, the determining the generator of the extended domain includes: Determine all non-zero elements in the extended domain; Each of the non-zero elements is checked one by one to confirm whether it satisfies the generator condition, which is: if for all d , both ,but is a generator, wherein the generator is a non-zero element in the extended domain, d for True factor of, said d is not equal to 1, said q is the order of the expansion domain; The non-zero elements satisfying the generator condition are determined as generators of the extended domain.

[0007] Optionally, the irreducible polynomial is ,in, , q is the order of the extended domain; the step of determining the minimal polynomial of the binary sequence according to the expansion order of the base domain and the irreducible polynomial comprises: Determine the extended domain according to the expansion times of the base domain and the irreducible polynomial; Determine the bipartite coset of the extended domain, the number of elements included in the bipartite coset is l， The number of even elements included in the bipartite coset is ; m and l The business, and then The two circumsector cosets whose product is an odd number are taken as the target circumsector cosets; Determining a definition set of the minimal polynomial according to the target cyclotomized coset; The minimal polynomial is determined according to the definition set and a general formula of the minimal polynomial.

[0008] Optionally, determining the extended domain according to the elements in the base domain and the number of expansions of the base domain includes: Determine the expansion domain to be solved according to the number of expansions of the base domain; Determine all parameter-containing polynomials whose degrees are less than the highest degree of the irreducible polynomial, wherein the values ​​of the parameters in the parameter-containing polynomials are the elements in the base field; Assigning the elements in the base domain to the parameters in the parameter-containing polynomial one by one to obtain the elements in the extended domain to be solved; The extended domain is determined according to elements in the extended domain to be solved.

[0009] Optionally, the general formula of the minimal polynomial is: ; in, is the generator, is the binary sequence The definition set of , j is an element in the definition set.

[0010] Optionally, the method further includes: The minimal polynomial is interpolated according to the primitive roots of the minimal polynomial to obtain a minimal polynomial after interpolation, wherein the number of continuous roots of the minimal polynomial after interpolation is greater than the number of continuous roots of the minimal polynomial before interpolation.

[0011] A second aspect of an embodiment of the present application provides a channel coding device based on a binary sequence, the device comprising: A data acquisition unit, used to acquire target data to be transmitted, and receive the expansion degree and irreducible polynomial of the base domain; A minimal polynomial generation unit, used for determining a minimal polynomial of a binary sequence according to the expansion times of the base domain and the irreducible polynomial; a cyclic code generating unit, configured to determine a generating polynomial of a cyclic code according to the minimal polynomial, and to generate the cyclic code according to the generating polynomial; A channel coding unit is used to perform channel coding on the target data according to the cyclic code.

[0012] A third aspect of the embodiments of the present application provides an electronic device, including: a processor and a memory; The processor is connected to the memory, wherein the memory is used to store a computer program, and the processor is used to call the computer program to execute the method in the first aspect of the embodiment of the present application.

[0013] A fourth aspect of an embodiment of the present application provides a computer-readable storage medium, which stores a computer program. The computer program includes program instructions. When the program instructions are executed by a processor, the method in the first aspect of the embodiment of the present application is executed.

[0014] The present application determines the minimal polynomial of the binary sequence according to the expansion order of the base field and the irreducible polynomial, determines the generating polynomial of the cyclic code according to the minimal polynomial, and generates the cyclic code according to the generating polynomial, thereby realizing the generation of the cyclic code; finally, the root-generated cyclic code performs channel coding on the target data, thereby realizing channel coding, thereby improving the reliability and anti-interference of the channel transmission. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0016] Figure 1 A schematic diagram of a flow chart of a channel coding method based on a binary sequence provided by an embodiment of the present application is shown; Figure 2 A schematic diagram of the structure of a binary sequence-based channel coding device provided by an embodiment of the present application is shown; Figure 3 A schematic diagram of the structure of a computer device provided in one embodiment of the present application is shown. DETAILED DESCRIPTION

[0017] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0018] Please refer to Figure 1 , which shows a flow chart of a channel coding method based on a binary sequence provided by an embodiment of the present application. The method can be applied to a computer device, which refers to an electronic device with data calculation and processing capabilities. The method may include the following steps: Step 101: Obtain target data to be transmitted, and receive the expansion degree and irreducible polynomial of the base domain.

[0019] The target data to be transmitted refers to information that needs to be transmitted through a certain communication channel. The target data can be in various forms, such as text, image, audio, video, etc. Before transmission, the target data can be encoded, compressed, etc. to improve transmission efficiency and ensure data accuracy.

[0020] Among them, the base domain is the basis of the extended domain, and the extended domain is a larger domain obtained by adding some elements on the basis of the base domain. The expansion number of the base domain refers to the dimension of one domain as a vector space on another domain.

[0021] An irreducible polynomial is a polynomial that cannot be expressed as the product of two polynomials of lower degree over a given number field.

[0022] Step 102: Determine a minimal polynomial of a binary sequence according to the expansion order of the base domain and the irreducible polynomial.

[0023] For example, through a finite field One way to construct a cyclic code is to use the following as the generator polynomial:

[0024] in, , is a binary sequence with period n, for The minimal polynomial of , gcd is the function for finding the greatest common divisor. Finite field Is the base domain The expansion domain when the expansion number m is 4.

[0025] Therefore, the expansion domain can be determined by the number of expansions of the base domain, and then the binary sequence can be determined based on the irreducible polynomial and the expansion domain. Minimal polynomial of .

[0026] Step 103: Determine a generator polynomial of a cyclic code according to the minimal polynomial, and generate the cyclic code according to the generator polynomial.

[0027] Step 104: Channel encode the target data according to the cyclic code.

[0028] For example, if the minimal polynomial Divisible ,in n is the code length, then The lowest multiple of and divisible by The polynomial is the generating polynomial Once the generating polynomial is determined , it can be used to generate cyclic codes. Specifically, any codeword can be generated by Multiplying by a polynomial gives h(x) obtained by dividing g(x) is called the check polynomial of the cyclic code.

[0029] It can be seen that in the embodiment of the present application, the minimal polynomial of the binary sequence is determined according to the expansion order of the base field and the irreducible polynomial, the generating polynomial of the cyclic code is determined according to the minimal polynomial, and the cyclic code is generated according to the generating polynomial, thereby realizing the generation of the cyclic code; finally, the root-generated cyclic code performs channel coding on the target data, thereby realizing channel coding, thereby improving the reliability and anti-interference of channel transmission.

[0030] In a specific embodiment of the present application, determining the minimal polynomial of the binary sequence according to the expansion degree of the base domain and the irreducible polynomial includes: Determine the extended domain according to the expansion times of the base domain and the irreducible polynomial; Determining a generator of the extended domain; Determine a target polynomial about a generator according to the generator and the irreducible polynomial; Determine an element in a binary sequence according to the trace of the target polynomial from the extended field to the base field; Determine the definition set of minimal polynomials based on the elements in the binary sequence; The minimal polynomial is determined according to the definition set and a general formula of the minimal polynomial.

[0031] Specifically, determining the extended domain according to the elements in the base domain and the number of expansions of the base domain includes: Determine the expansion domain to be solved according to the number of expansions of the base domain; Determine all parameter-containing polynomials whose degrees are less than the highest degree of the irreducible polynomial, wherein the values ​​of the parameters in the parameter-containing polynomials are the elements in the base field; Assigning the elements in the base domain to the parameters in the parameter-containing polynomial one by one to obtain the elements in the extended domain to be solved; The extended domain is determined according to elements in the extended domain to be solved.

[0032] Exemplarily, the base domain is , , the expansion times m is 4, then we can determine the expansion domain to be solved as .set up yes An irreducible polynomial on , then we can construct the extension field ,in yes A root of , m is The elements in the extended domain can represent a The parameterized polynomial ,in .Will Assign values ​​to the parameters of the polynomial one by one a , we can get:

[0033] Specifically, the determining the generator of the extended domain includes: Determine all non-zero elements in the extended domain; Each of the non-zero elements is checked one by one to confirm whether it satisfies the generator condition, which is: if for all d , both ,but is a generator, wherein the generator is a non-zero element in the extended domain, d for True factor of, said d is not equal to 1, said q is the order of the expansion domain; The non-zero elements satisfying the generator condition are determined as generators of the extended domain.

[0034] For example, the domain is expanded to ,but , for the element ,have: , , , , , , , , , , , , , , , Take all All non-zero elements of yes The generator of . Similarly, The other non-zero elements of can also be verified by the same method, which will not be repeated here. It should be noted that the generator can be one or more, which is determined according to the specific expansion domain.

[0035] For example, the generator is Represented by irreducible polynomials If we express it, then about the generator The target polynomial is or express, is the index of the binary sequence. Then the binary sequence and The The components are: and , in, Indicates that in the expansion To base domain It is easy to know that sequence U is a subsequence of sequence S. Therefore, the elements in the binary sequence can be determined according to the trace of the target polynomial from the extended field to the base field, and then the definition set of minimal polynomials can be determined according to the elements in the binary sequence.

[0036] Specifically, elements in a binary sequence are determined according to the trace of a target polynomial from an extended domain to a base domain, and a definition set of a minimal polynomial is determined according to the elements in the binary sequence, including: determining each term of the target polynomial, determining the trace of each term of the target polynomial from an extended domain to a base domain, taking the intersection of the traces of all terms of the target polynomial from the extended domain to the base domain to obtain elements in the binary sequence, and using the set formed by the elements in the binary sequence as the definition set of the minimal polynomial.

[0037] For example, m=4, When: =

[0038]

[0039]

[0040] Take the first item For example, we have:

[0041] Represents the first elements or components are temporarily ignored when calculating the trace, then the trace corresponding to the first item is: ; Similarly, the traces corresponding to the 0th, second, and third terms are: ; ; ; You only need to keep and , we can get the sequence and The definition sets are and{ ,12}.

[0042] In the above embodiment, for any form of All of them can determine the domain of the minimal polynomial, and for some specific forms , the above process can be further simplified, thereby improving the speed of determining the minimal polynomial definition set.

[0043] In a specific embodiment of the present application, the irreducible polynomial is ,in, , q is the order of the extended domain; the step of determining the minimal polynomial of the binary sequence according to the expansion order of the base domain and the irreducible polynomial comprises: Determine the extended domain according to the expansion times of the base domain and the irreducible polynomial; Determine the bipartite coset of the extended domain, the number of elements included in the bipartite coset is l， The number of even elements included in the bipartite coset is ; m and l The business, and then The two circumsector cosets whose product is an odd number are taken as the target circumsector cosets; Determining a definition set of the minimal polynomial according to the target cyclotomized coset; The minimal polynomial is determined according to the definition set and a general formula of the minimal polynomial.

[0044] For example, m=4, ,but The 2-part circle coset of is:

[0045]

[0046]

[0047]

[0048] Number of elements in l =4 ， Even number of elements =3, ,so is the target circular coset; Number of elements in l =4 ， Even number of elements =2, ,so It is not the target circular coset; Number of elements in l =2 ， Even number of elements =1, ,so It is not the target circular coset; Number of elements in l =4 ， Even number of elements =1, ,so is the target cyclotomic coset. Then, the definition set of minimal polynomials is {1,2,4,7,8,11,13,14}.

[0049] It should be noted that the extended domain is determined according to the expansion times of the base domain and the irreducible polynomial, as described in the above embodiment, which will not be described in detail.

[0050] In a specific embodiment of the present application, the general formula of the minimal polynomial is: ; in, is the generator, is the binary sequence The definition set of , j is an element in the definition set.

[0051] The number of consecutive primitive roots can be determined based on the minimum polynomial, and the number of consecutive primitive roots plus one represents the distance of the cyclic code. For example, When defining the set { ,12}, the roots of the generating polynomial are , the number of consecutive primitive roots is 4, so the lower bound of the code distance d is 5; define the set , the roots of the generating polynomial are , the number of consecutive roots is 2, so the lower bound of the code distance is 3.

[0052] Furthermore, the method further comprises: The minimal polynomial is interpolated according to the primitive roots of the minimal polynomial to obtain a minimal polynomial after interpolation, wherein the number of continuous primitive roots of the minimal polynomial after interpolation is greater than the number of continuous primitive roots of the minimal polynomial before interpolation.

[0053] For example, When the sequence To explain, define the set { ,12}, the original root is: , the number of consecutive primitive roots is 4, so the lower bound of the code distance d is 5. As the primitive root is added, the number of consecutive primitive roots will become 9, which greatly increases the code distance. Code distance is an important indicator to measure coding performance. A larger code distance can improve the error correction capability of channel coding. When an error occurs in the channel, the receiving end can detect and correct the error based on the difference between the codewords. If the code distance is larger, then even if some errors occur, it is easier for the receiving end to distinguish the erroneous codewords from the correct codewords, thereby improving the success rate of error correction. In addition, a larger code distance can also improve the error detection capability of channel coding. Even if the error cannot be completely corrected, a larger code distance can make it easier for the receiving end to detect the existence of the error and take corresponding measures, such as requesting retransmission. Therefore, Insert the original minimal polynomial to get a new minimal polynomial .

[0054] Figure 2 The schematic diagram of the structure of a binary sequence-based channel coding device provided by an embodiment of the present application is shown. The device includes: The data acquisition unit 201 is used to acquire the target data to be transmitted, and the expansion degree and irreducible polynomial of the receiving base domain; A minimal polynomial generating unit 202, configured to determine a minimal polynomial of a binary sequence according to the expansion times of the base domain and the irreducible polynomial; A cyclic code generating unit 203, configured to determine a generating polynomial of a cyclic code according to the minimal polynomial, and generate the cyclic code according to the generating polynomial; The channel coding unit 204 is configured to perform channel coding on the target data according to the cyclic code.

[0055] Figure 3 A schematic diagram of the structure of a computer device provided in one embodiment of the present application is shown, including a memory and a processor, the memory stores a computer program, and the processor implements the functions of a computer system of a binary sequence-based channel coding method in any of the above-mentioned embodiments when executing the computer program.

[0056] The embodiments of the present application further provide a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a computer, the computer executes the functions of the computer system of the channel coding method based on a binary sequence in any of the above embodiments.

[0057] The embodiments of the present application further provide a computer program product comprising instructions, which, when executed by a computer, enables the computer to perform the functions of a computer system of the channel coding method based on a binary sequence in any of the above embodiments.

[0058] It should be understood that the specific examples in this application are only intended to help those skilled in the art to better understand the embodiments of the present application, rather than to limit the scope of the present invention.

[0059] It can be understood that in the various implementations of the present application, the size of the serial number of each process does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the implementation methods of the present application.

[0060] It can be understood that the various embodiments described in this application can be implemented individually or in combination, and the embodiments of this application are not limited to this.

[0061] Unless otherwise stated, all technical and scientific terms used in the embodiments of the present application have the same meaning as those generally understood by those skilled in the art of the technical field of the present application. The terms used in the present application are only for the purpose of describing specific embodiments and are not intended to limit the scope of the present application. The term "and / or" used in the present application includes any and all combinations of one or more related listed items. The singular forms of "a kind of", "above" and "the" used in the embodiments of the present application and the appended claims are also intended to include plural forms, unless the context clearly indicates other meanings.

[0062] It can be understood that the processor of the embodiment of the present application can be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method implementation can be completed by the hardware integrated logic circuit or software instructions in the processor. The above processor can be a general processor, a digital signal processor (DigitalSignal Processor, DSP), an application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiment of the present application can be implemented or executed. The general processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in the embodiment of the present application can be directly embodied as a hardware decoding processor to perform, or the hardware and software modules in the decoding processor are combined and executed. The software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

[0063] It is understood that the memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (programmable ROM, PROM), an erasable programmable read-only memory (erasable PROM, EPROM), an electrically erasable programmable read-only memory (EEPROM) or a flash memory. The volatile memory may be a random access memory (RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0064] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0065] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method implementation methods and will not be repeated here.

[0066] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device implementation described above is only schematic. For example, the division of units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0067] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0068] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0069] If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium, including a number of instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of each implementation method of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk, etc., various media that can store program codes.

[0070] The above are only specific embodiments of the present application, but the protection scope of the present invention is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims

1. A channel coding method based on a binary sequence, characterized in that: The method comprises: Obtaining target data to be transmitted, and receiving the expansion degree and irreducible polynomial of the base domain; Determine a minimal polynomial of a binary sequence according to the expansion order of the base domain and the irreducible polynomial; Determining a generator polynomial of a cyclic code according to the minimal polynomial, and generating the cyclic code according to the generator polynomial; The target data is channel-coded according to the cyclic code.

2. The method according to claim 1, characterized in that The step of determining the minimal polynomial of the binary sequence according to the expansion times of the base domain and the irreducible polynomial comprises: Determine the extended domain according to the expansion times of the base domain and the irreducible polynomial; Determining a generator of the extended domain; Determine a target polynomial about a generator according to the generator and the irreducible polynomial; Determine an element in a binary sequence according to the trace of the target polynomial from the extended field to the base field; Determine the definition set of minimal polynomials based on the elements in the binary sequence; The minimal polynomial is determined according to the definition set and a general formula of the minimal polynomial.

3. The method according to claim 2, characterized in that The determining of the generator of the extended domain includes: Determine all non-zero elements in the extended domain; Each of the non-zero elements is checked one by one to confirm whether it satisfies the generator condition, which is: if for all d , both ,but is a generator, wherein the generator is a non-zero element in the extended domain, d for True factor of, said d is not equal to 1, said q is the order of the expansion domain; The non-zero elements satisfying the generator condition are determined as generators of the extended domain.

4. The method according to claim 1, characterized in that The irreducible polynomial is ,in, , q is the order of the extended domain; the step of determining the minimal polynomial of the binary sequence according to the expansion order of the base domain and the irreducible polynomial comprises: Determine the extended domain according to the expansion times of the base domain and the irreducible polynomial; Determine the bipartite coset of the extended domain, the number of elements included in the bipartite coset is l， The number of even elements included in the bipartite coset is ; m and l The business, and then The two circumsector cosets whose product is an odd number are taken as the target circumsector cosets; Determining a definition set of the minimal polynomial according to the target cyclotomized coset; The minimal polynomial is determined according to the definition set and a general formula of the minimal polynomial.

5. The method according to claim 4, characterized in that The step of determining the extended domain according to the elements in the base domain and the number of expansions of the base domain comprises: Determine the expansion domain to be solved according to the number of expansions of the base domain; Determine all parameter-containing polynomials whose degrees are less than the highest degree of the irreducible polynomial, wherein the values ​​of the parameters in the parameter-containing polynomials are the elements in the base field; Assigning the elements in the base domain to the parameters in the parameter-containing polynomial one by one to obtain the elements in the extended domain to be solved; The extended domain is determined according to elements in the extended domain to be solved.

6. The method according to claim 5, characterized in that The general formula for the minimal polynomial is: ； in, is the generator, is the binary sequence The definition set of , j is an element in the definition set.

7. The method according to claim 6, characterized in that The method further comprises: The minimal polynomial is interpolated according to the primitive roots of the minimal polynomial to obtain a minimal polynomial after interpolation, wherein the number of continuous roots of the minimal polynomial after interpolation is greater than the number of continuous roots of the minimal polynomial before interpolation.

8. A channel coding device based on a binary sequence, characterized in that: The device comprises: A data acquisition unit, used to acquire target data to be transmitted, and receive the expansion degree and irreducible polynomial of the base domain; A minimal polynomial generation unit, used for determining a minimal polynomial of a binary sequence according to the expansion times of the base domain and the irreducible polynomial; a cyclic code generating unit, configured to determine a generating polynomial of a cyclic code according to the minimal polynomial, and to generate the cyclic code according to the generating polynomial; A channel coding unit is used to perform channel coding on the target data according to the cyclic code.

9. An electronic device, characterized in that: include: Processor and memory; The processor is connected to a memory, wherein the memory is used to store a computer program, and the processor is used to call the computer program to execute the method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, wherein the computer program includes program instructions, and when the program instructions are executed by a processor, the method according to any one of claims 1 to 7 is executed.

Images