CN114553241A - Mark code transmission method adopting data punching - Google Patents

Mark code transmission method adopting data punching Download PDF

Info

Publication number
CN114553241A
CN114553241A CN202210066607.4A CN202210066607A CN114553241A CN 114553241 A CN114553241 A CN 114553241A CN 202210066607 A CN202210066607 A CN 202210066607A CN 114553241 A CN114553241 A CN 114553241A
Authority
CN
China
Prior art keywords
sequence
code
symbol
outputting
sigma
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202210066607.4A
Other languages
Chinese (zh)
Inventor
柳元
鲁艺为
徐哲
李润霖
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tianjin Normal University
Original Assignee
Tianjin Normal University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tianjin Normal University filed Critical Tianjin Normal University
Priority to CN202210066607.4A priority Critical patent/CN114553241A/en
Publication of CN114553241A publication Critical patent/CN114553241A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1105—Decoding
    • H03M13/1111—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms
    • H03M13/1125—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms using different domains for check node and bit node processing, wherein the different domains include probabilities, likelihood ratios, likelihood differences, log-likelihood ratios or log-likelihood difference pairs
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/635—Error control coding in combination with rate matching
    • H03M13/6362—Error control coding in combination with rate matching by puncturing
    • H03M13/6368—Error control coding in combination with rate matching by puncturing using rate compatible puncturing or complementary puncturing
    • H03M13/6393—Rate compatible low-density parity check [LDPC] codes

Abstract

The invention discloses a mark code transmission method adopting data punching, which comprises the following steps: the binary information sequence u is generated by an encoder of a binary LDPC code to have the length of NLThe coding sequence f; uniformly inserting the marker code omega into the coding sequence f to generate the length NcAnd outputting the concatenated code g; puncturing the sigma-th bit in each symbol in the concatenated code g to generate a transmission sequence g'; generating a receiving sequence h by the transmitting sequence g' through an inserting/deleting-replacing channel; correcting insertion/deletion errors in a receiving sequence h through a WED-based symbol-level synchronous restorer, assigning a value beta to likelihood information at a punching position, and finally outputting a likelihood ratio sequence l; initializing the binary LDPC decoder through a likelihood ratio sequence l, decoding the binary LDPC decoder by utilizing a logarithm domain confidence propagation decoding algorithm, and outputting the estimation of an information sequence
Figure DDA0003480500330000011
The invention improves the transmission rate of the system on the premise of ensuring that the transmission performance of the system is not lost.

Description

Mark code transmission method adopting data punching
Technical Field
The invention relates to the field of digital communication error control coding, in particular to a mark code transmission method adopting data puncturing.
Background
Researchers have designed synchronous error correcting codes for synchronous errors caused by unstable sampling clock rates of communication systems, i.e., insertion/deletion errors. Insertion/deletion and substitution errors will cause catastrophic consequences, i.e., the length of the transceiving sequence is inconsistent and a large number of sudden substitution errors exist, reducing system performance; meanwhile, the conventional error control coding technology for the memoryless channel and the alternative design of errors cannot be directly adopted.
The traditional concatenated coding scheme which can correct a plurality of insertion/deletion and substitution errors and is proposed by Davey and MacKay is called DM code for short hereinafter, and watermark-LDPC (low density parity check) concatenated code is adopted to correct insertion/deletion errors, so that the performance is excellent. In order to further improve the error correction capability of the DM scheme and the flexibility of the system, researchers propose a tag code transmission method based on Weighted Edit Distance (WED). The method inserts the mark code as the inner code into the outer code binary LDPC code uniformly, and simultaneously proposes the symbol level synchronization algorithm to recover the length of the receiving sequence. The method obtains excellent error correction capability, has strong portability of a decoding module, is not limited to a cascade mode between an internal code and an external code, and can be flexibly applied to a system for marking codes or watermark codes. However, the WED-based signature code transmission method still has to be improved in terms of data transmission rate.
Therefore, how to design an insertion/erasure coding and decoding algorithm with high transmission rate is a long-term research problem in the field.
Disclosure of Invention
The invention provides a mark code transmission method adopting data punching, which improves the transmission rate of a system on the premise of ensuring that the transmission performance of the system is not lost, and is described in detail as follows:
a method for marker code transmission with data puncturing, the method comprising:
(1) the binary information sequence u is generated by an outer code, i.e. an encoder of a binary LDPC code, to a length NLOf (a) a coding sequencef；
(2) Will be provided withThe marker code omega is uniformly inserted into the coding sequencefIn (1), the generation length is NcAnd outputting the concatenated code g;
(3) puncturing the sigma-th bit in each symbol in the concatenated code g to generate a transmission sequence g';
(4) generating a receiving sequence h by the transmitting sequence g' through an inserting/deleting-replacing channel;
(5) correcting insertion/deletion errors in a receiving sequence h through a WED-based symbol-level synchronous restorer, assigning a value beta to likelihood information at a punching position, and finally outputting a likelihood ratio sequence l;
(6) initializing the binary LDPC decoder through a likelihood ratio sequence l, decoding the binary LDPC decoder by utilizing a logarithm domain confidence propagation decoding algorithm, and outputting the estimation of an information sequence
Figure BDA0003480500310000022
Wherein the marker code omega is uniformly inserted into the coding sequencefIn (1), the generation length is NcAnd outputting the concatenated code g as:
decoding binary LDPC codesfDividing into N symbols, each symbol having m bits, where N is NL(ii)/m; an inner encoder randomly generates a mark code omega with the length of NxLambda, divides the mark code omega into N subsequences with the length of Lambda, and inserts each subsequence of the mark code omega into a binary LDPC codefBefore each symbol of (2), generating a length of NcEach symbol contains lambda watermark bits, m LDPC code bits.
Further, the puncturing of the σ -th bit in each symbol in the concatenated code g yields a transmission sequence g' of:
(3.1) making the symbol subscript j equal to 0, wherein the frame cascade code g comprises N symbols;
(3.2) letting the bit subscript i in each symbol be 0;
(3.3) judging whether i is equal to sigma; when i is not equal to sigma, continuously judging whether i is less than sigma, if so, g'j(m-1)+i＝gjm+iExecuting the step (3.4); otherwise i is greater than sigma, g'j(m-1)+i-1＝gjm+iI +1, performing step (3.4);
(3.4) judging whether i is equal to sigma, if so, i is equal to i +1, and executing the step (3.5); if not, repeating the step (3.3);
(3.5) judging whether i is less than m, if so, returning to the step (3.3); if not, executing the step (3.6);
(3.6)j＝j+1；
(3.7) judging whether j is less than N, if so, returning to the step (3.2); if not, outputting a sending sequence g', and ending the process.
Wherein, the likelihood information at the punching position is assigned with β, and finally the output likelihood ratio sequence l is:
(5.1) letting the bit subscript k be 0, j be 0;
(5.2) judging the log-likelihood ratio l of the k-th bit if k% m is σkβ, where σ is the punch position; otherwise, lkIs calculated as follows:
Figure BDA0003480500310000021
wherein a is more than 0 and less than or equal to q-1, k is more than or equal to 0 and less than NL，0≤j＜N，
Figure BDA0003480500310000031
Denotes the jth symbol, fkRepresents the kth transmitted bit;
Figure BDA0003480500310000032
wherein the content of the first and second substances,
Figure BDA0003480500310000033
is shown at f k1 and
Figure BDA0003480500310000034
under the condition of (1), the probability of receiving h, tiRepresenting the amount of state drift at i, F (-), B (-), and M (-), representing the forward direction, respectivelyBackward and intermediate metrics;
(5.3)j＝j+1，k＝k+1；
(5.4) if k < NLAnd then returning to the step (5.2); otherwise, outputting the likelihood ratio sequence l, and ending the process.
The technical scheme provided by the invention has the beneficial effects that:
1. on the basis of the traditional mark code transmission method, the invention adopts a data punching method, reduces the bit number required by transmission, improves the transmission efficiency and has almost no performance loss;
2. the invention shortens the code length of the sending sequence and reduces the decoding delay and the decoding calculation complexity of the system.
Drawings
FIG. 1 is a system diagram of a marker code transmission method employing data puncturing;
FIG. 2 is a diagram of a frame structure for a transmission sequence;
FIG. 3 is a flow chart of data puncturing;
FIG. 4 is a flow chart of calculating a sequence of likelihood ratios;
FIG. 5 is a diagram illustrating error accumulation for received symbols;
FIG. 6 is a schematic diagram of performance simulation before and after punching.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, embodiments of the present invention are described in further detail below.
Through system simulation, the embodiment of the invention discovers that in the WED-based marker code transmission method, the probability of errors occurring in bits close to a specific position of a marker code is obviously higher than that of the rest bits. Therefore, the embodiment of the invention adopts the data punching technology, deletes the information bits which are easy to make errors at the sending end, and only transmits the residual bits, thereby achieving the purpose of transmitting information by using less bit numbers. This method is expected to improve the transmission bit rate while ensuring that the system error correction performance is not lost.
Compared with the traditional scheme, the embodiment of the invention is modified as follows: aiming at a WED-based mark code transmission scheme, data puncturing is carried out on a sending sequence, bits on error-prone information bits are deleted, and only unpunctured bits are transmitted. At the receiving end, the inner decoder utilizes a WED-based symbol-level synchronization restorer to compare with the known mark codes so as to restore synchronization, further assigns values to the likelihood information of the punching positions, and then outputs a likelihood ratio sequence for the LDPC code decoder to correct residual errors. Compared with the transmission method without the technology, the method reduces the bit number required to be transmitted, transmits information by sending fewer bits to achieve the same effect, and improves the transmission rate on the premise of not influencing the error correction performance of the system.
The embodiment of the invention provides a mark code transmission method adopting data punching, which is characterized in that based on the traditional mark code transmission method, the transmitted information is subjected to data punching before entering an insertion/deletion-substitution channel, the error-prone information bits in the signal are removed, and the same information is transmitted by sending fewer bit numbers, so that the transmission rate of the system is effectively improved, and the performance is ensured not to be deteriorated.
The following describes a transmission method of a mark code using data puncturing according to an embodiment of the present invention in detail with reference to the accompanying drawings.
As shown in fig. 1, the embodiment of the present invention includes the following six steps:
(1) the binary information sequence u is generated by an outer code, i.e. an encoder of a binary LDPC code, to a length NLOf (a) a coding sequencef；
(2) Uniformly inserting marker code omega into coding sequencefIn (1), the generation length is NcAnd outputting the concatenated code g;
(3) puncturing the sigma-th bit in each symbol in the concatenated code g to generate a transmission sequence g';
(4) generating a receiving sequence h by the transmitting sequence g' through an inserting/deleting-replacing channel;
(5) correcting insertion/deletion errors in a receiving sequence h through a WED-based symbol-level synchronous restorer, assigning a value beta to likelihood information at a punching position, and finally outputting a likelihood ratio sequence l;
(6) tong (Chinese character of 'tong')Initializing the binary LDPC decoder by the over-likelihood ratio sequence l, decoding the binary LDPC decoder by using a logarithm domain confidence propagation decoding algorithm, and outputting the estimation of the information sequence
Figure BDA0003480500310000041
The specific implementation steps of the above six steps are described below, and are described in detail below:
the encoder of the binary LDPC code in step (1) is a professional term in the art, and is not described in detail in the embodiment of the present invention.
As shown in FIG. 2, the step (2) inserts the marker code ω uniformly into the code sequencefIn (1), the generation length is NcAnd outputting the concatenated code g comprises:
(2.1) binary LDPC codesfDividing into N symbols, each symbol having m bits, where N is NL/m；
(2.2) the inner encoder randomly generates a mark code omega of length N x λ, divides the mark code omega into N subsequences of length λ, inserts each subsequence of the mark code omega into the binary LDPC codefBefore each symbol of (2), generating a length of NcWherein each symbol contains λ watermark bits, m LDPC code bits.
As shown in fig. 3, the step (3) of puncturing the σ -th bit in each symbol in the concatenated code g to generate the transmission sequence g' includes:
(3.1) letting the symbol subscript j be 0, wherein a frame of concatenated code g comprises N symbols;
(3.2) letting the bit subscript i in each symbol be 0;
(3.3) judging whether i is equal to sigma; when i is not equal to sigma, continuously judging whether i is less than sigma, if so, g'j(m-1)+i＝gjm+iStep (3.4) is executed otherwise i > sigma, g'j(m-1)+i-1＝gjm+iI +1, performing step (3.4);
(3.4) judging whether i is equal to sigma, if so, i is equal to i +1, and executing the step (3.5); if not, repeating the step (3.3);
(3.5) judging whether i is less than m, if so, returning to the step (3.3); if not, executing the step (3.6);
(3.6)j＝j+1；
(3.7) judging whether j is less than N, if so, returning to the step (3.2); if not, outputting a sending sequence g', and ending the process.
The step (4) of generating the reception sequence h through the insertion/puncturing-substitution channel by the transmission sequence g' includes:
the transmission sequence g' passes through the insertion/deletion-substitution channel, parameter Pi，PdAnd PsRespectively representing insertion, pruning and substitution probabilities. Probability of transmission Pt＝1-Pi-Pd。
The above mentioned add/drop-replace channel is a term of art, and is not described in detail in the embodiments of the present invention.
As shown in fig. 4, the step (5) corrects insertion/deletion errors in the received sequence h by the WED-based symbol-level synchronization restorer, and assigns β to the likelihood information at the punctured position, and finally outputs the likelihood ratio sequence l including:
(5.1) letting the bit subscript k be 0 and the symbol subscript j be 0;
(5.2) judging the log-likelihood ratio l of the k-th bit if k% m is σkβ, where σ is the punch position; otherwise, lkIs calculated as follows:
Figure BDA0003480500310000061
wherein a is more than 0 and less than or equal to q-1, k is more than or equal to 0 and less than NL，0≤j＜N，
Figure BDA0003480500310000062
Denotes the jth symbol, fkRepresenting the kth transmitted bit.
Figure BDA0003480500310000063
Wherein the content of the first and second substances,
Figure BDA0003480500310000064
is shown at f k1 and
Figure BDA0003480500310000065
under the condition of (1), the probability of receiving h, tiRepresenting the amount of state drift at i, F (-), B (-), and M (-), representing the forward, backward, and intermediate metrics, respectively.
(5.3)j＝j+1，k＝k+1；
(5.4) if k < NLAnd then returning to the step (5.2); otherwise, outputting the likelihood ratio sequence l, and ending the process.
Step (6), the binary LDPC decoder completes iterative decoding by using the likelihood ratio sequence l and outputs the estimation of the information sequence
Figure BDA0003480500310000066
Comprises the following steps:
sending the likelihood ratio sequence l into a binary LDPC decoder; decoding by adopting a logarithm domain belief propagation decoding algorithm of a binary LDPC code; repeating the decoding steps until reaching the preset maximum iteration number deltamax. The logarithm domain belief propagation decoding algorithm of the binary LDPC code is a professional term in the art, and details of the method are omitted in the embodiments of the present invention.
DETAILED DESCRIPTION OF EMBODIMENT (S) OF INVENTION
The embodiment of the invention compares the code which does not adopt data punching with the code which is subjected to data punching, and selects the code length NcFor 576 bits, a concatenated code with a code rate of 0.5 is a special case, and a transmission method of a mark code adopting data puncturing is introduced. In simulation, a pseudo-random sequence is used as an internal mark code, a binary LDPC code is used as an external code, wherein lambda is 1, NL＝720，RL0.5, the maximum number of insertion errors per bit in the channel I is 5, Pi＝PdThe decoder of the binary LDPC code adopts a logarithm domain confidence propagation decoding algorithm, and the maximum iteration time is 50 times.
Using a binary pseudo-random sequence, where λ 1, Pd＝PiMaximum per bit occurrence in the channelThe number of insertion errors I is 5. When m is 4 and m is 6, the probability of deletion P is counteddThe probability of each information bit being in error is 0.01. Fig. 5 shows the error condition of each information bit of the transmission sequence, and as shown in fig. 5, the error probability of σ bit is higher in each symbol of the transmission codeword than that of other bits, and σ is 2.
The code rate calculation mode after punching is as follows:
Figure BDA0003480500310000071
wherein N is selectedL＝576，RLBinary LDPC code of 0.5 as outer code, DCIndicating the number of bits deleted in a frame, DIIndicating the number of bits deleted in the information sequence.
Fig. 6 shows the block error rate of the system as a function of the insertion/deletion probability for different alternative probabilities, where the block error rate is equal to the number of error frames divided by the number of transmitted frames. It can be seen that the system has little performance degradation before and after data puncturing.
In the embodiment of the present invention, except for the specific description of the model of each device, the model of other devices is not limited, as long as the device can perform the above functions.
Those skilled in the art will appreciate that the drawings are only schematic illustrations of preferred embodiments, and the above-described embodiments of the present invention are merely provided for description and do not represent the merits of the embodiments.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.

Claims (4)

1. A method for transmitting a mark code by puncturing data, the method comprising:
the binary information sequence u is generated by an encoder of a binary LDPC code to have the length of NLOf (a)f(ii) a Uniformly inserting a mark code omega intoCoding sequencefIn (1), the generation length is NcAnd outputting the concatenated code g;
puncturing the sigma-th bit in each symbol in the concatenated code g to generate a transmission sequence g'; generating a receiving sequence h by the transmitting sequence g' through an inserting/deleting-replacing channel;
correcting insertion/deletion errors in a receiving sequence h through a WED-based symbol-level synchronous restorer, assigning a value beta to likelihood information at a punching position, and finally outputting a likelihood ratio sequence l;
initializing the binary LDPC decoder through a likelihood ratio sequence l, decoding the binary LDPC decoder by utilizing a logarithm domain confidence propagation decoding algorithm, and outputting the estimation of an information sequence
Figure FDA0003480500300000011
2. The method as claimed in claim 1, wherein the mark code ω is uniformly inserted into the code sequencefIn, the generation length is NcAnd outputting the concatenated code g as:
decoding binary LDPC codesfDividing into N symbols, each symbol having m bits, where N is NL/m；
An inner encoder randomly generates a mark code omega with the length of NxLambda, divides the mark code omega into N subsequences with the length of Lambda, and inserts each subsequence of the mark code omega into a binary LDPC codefBefore each symbol of (2), generating a length of NcEach symbol contains lambda watermark bits, m LDPC code bits.
3. The method of claim 1, wherein the puncturing is performed on a sigma-th bit in each symbol in the concatenated code g, and the puncturing generates the transmission sequence g' as:
(3.1) letting the symbol subscript j be 0, wherein a frame of concatenated code g comprises N symbols;
(3.2) letting the bit subscript i in each symbol be 0;
(3.3) judging whether i is equal to sigma; when i is not equal to sigma, continuously judging whether i is less than sigma, if so, g'j(m-1)+i＝gjm+iStep (3.4) is executed otherwise i > sigma, g'j(m-1)+i-1＝gjm+iI +1, performing step (3.4);
(3.4) judging whether i is equal to sigma, if so, i is equal to i +1, and executing the step (3.5); if not, repeating the step (3.3);
(3.5) judging whether i is less than m, if so, returning to the step (3.3); if not, executing the step (3.6);
(3.6)j＝j+1；
(3.7) judging whether j is less than N, if so, returning to the step (3.2); if not, outputting a sending sequence g', and ending the process.
4. The method as claimed in claim 1, wherein the likelihood information at the position of the punch is assigned with β, and the final output likelihood ratio sequence l is:
(5.1) letting the bit subscript k be 0, j be 0;
(5.2) judging the log-likelihood ratio l of the k-th bit if k% m is σkβ, where σ is the punch position; otherwise, lkIs calculated as follows:
Figure FDA0003480500300000021
wherein a is more than 0 and less than or equal to q-1, k is more than or equal to 0 and less than NL，0≤j＜N，
Figure FDA0003480500300000022
Denotes the jth symbol, fkRepresents the kth transmitted bit;
Figure FDA0003480500300000023
wherein the content of the first and second substances,
Figure FDA0003480500300000024
is shown at fk1 and
Figure FDA0003480500300000025
under the condition of (1), the probability of receiving h, tiRepresenting the amount of state drift at i, F (-), B (-), and M (-), representing the forward, backward, and intermediate metrics, respectively;
(5.3)j＝j+1，k＝k+1；
(5.4) if k < NLAnd then returning to the step (5.2); otherwise, outputting the likelihood ratio sequence l, and ending the process.
CN202210066607.4A 2022-01-20 2022-01-20 Mark code transmission method adopting data punching Pending CN114553241A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210066607.4A CN114553241A (en) 2022-01-20 2022-01-20 Mark code transmission method adopting data punching

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210066607.4A CN114553241A (en) 2022-01-20 2022-01-20 Mark code transmission method adopting data punching

Publications (1)

Publication Number Publication Date
CN114553241A true CN114553241A (en) 2022-05-27

Family

ID=81670933

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210066607.4A Pending CN114553241A (en) 2022-01-20 2022-01-20 Mark code transmission method adopting data punching

Country Status (1)

Country Link
CN (1) CN114553241A (en)

Similar Documents

Publication Publication Date Title
JP5318583B2 (en) System and method for providing H-ARQ rate compatible codes for high throughput applications
Davey et al. Reliable communication over channels with insertions, deletions, and substitutions
KR101330132B1 (en) Decoding of raptor codes
CN1132320C (en) Optimal soft-output decoder for tail-biting trellis codes
CN110995278B (en) Improved polarity code serial elimination list bit overturning decoding method and system
CN106888026A (en) Segmentation polarization code coding/decoding method and system based on LSC CRC decodings
CN106656208A (en) Concatenated code method of symbol-level hard decision iteration decoding correcting synchronization errors
US6950975B2 (en) Acceleration of convergence rate with verified bits in turbo decoding
CN108809518B (en) Method for constructing cascade Spinal code for reducing error performance
CN105703781A (en) Hard decision guided forward and backward estimating method for estimating synchronization erroneous position
CN106656209B (en) Cascade code method for correcting synchronous errors by adopting iterative decoding
CN106712901A (en) Hard decision-directed forward and backward estimation method under symbol insertion and deletion channel
CN108134612B (en) Iterative decoding method for correcting synchronous and substitute error cascade code
CN106788458B (en) Hard decision-oriented forward and backward estimation method for insertion deletion and substitution errors
US8359511B2 (en) Method and system for constructing and decoding rateless codes with partial information
CN108063623B (en) Serial elimination decoding method of Polar code for reducing complexity
CN111313908A (en) Irregular watermark coding and decoding method for correcting non-binary insertion/deletion
CN111510166A (en) Method for processing symbol insertion and deletion in 4DPPM detection
CN114553241A (en) Mark code transmission method adopting data punching
CN112929131B (en) Mark code transmission method based on weighted editing distance
US11863202B2 (en) Polar coding and decoding for correcting deletion and/or insertion errors
Kracht et al. Using the Davey-MacKay code construction for barcodes in DNA sequencing
CN111130564B (en) Decoding method and device
CN115425989A (en) Marker-LDPC code transmission method based on data preprocessing
CN112332866A (en) Method for identifying cascade code parameters based on DVB-S and DVB-S2 signals

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination