CN107424199A - It is a kind of to figure encryption correcting data error and detection method - Google Patents
It is a kind of to figure encryption correcting data error and detection method Download PDFInfo
- Publication number
- CN107424199A CN107424199A CN201710667274.XA CN201710667274A CN107424199A CN 107424199 A CN107424199 A CN 107424199A CN 201710667274 A CN201710667274 A CN 201710667274A CN 107424199 A CN107424199 A CN 107424199A
- Authority
- CN
- China
- Prior art keywords
- data
- ldpc
- bit
- matrix
- polynomial
- 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.)
- Granted
Links
- 238000001514 detection method Methods 0.000 title claims abstract 9
- 238000000034 method Methods 0.000 claims abstract description 37
- 238000012937 correction Methods 0.000 claims abstract description 18
- 239000011159 matrix material Substances 0.000 claims description 54
- 238000006243 chemical reaction Methods 0.000 claims description 11
- 238000010586 diagram Methods 0.000 claims description 9
- 238000013139 quantization Methods 0.000 claims description 7
- 208000011580 syndromic disease Diseases 0.000 claims description 6
- 238000012935 Averaging Methods 0.000 claims description 3
- 238000013507 mapping Methods 0.000 claims description 3
- 241001269238 Data Species 0.000 abstract 3
- 238000011002 quantification Methods 0.000 abstract 1
- 238000012545 processing Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013524 data verification Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T9/00—Image coding
-
- 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/1148—Structural properties of the code parity-check or generator matrix
-
- 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/13—Linear codes
- H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
- H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
- H03M13/1515—Reed-Solomon codes
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Mathematical Physics (AREA)
- Theoretical Computer Science (AREA)
- Probability & Statistics with Applications (AREA)
- General Physics & Mathematics (AREA)
- Multimedia (AREA)
- Algebra (AREA)
- Pure & Applied Mathematics (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention discloses a kind of to figure encryption correcting data error and the method for detection, in turn include the following steps：The first step, internal layer RS codings；Second step, outer layer LDPC codings；3rd step, form dot chart；4th step, to dot chart quantification treatment；5th step, outer layer LDPC decodings, carry out LDPC decodings to quantized data, generate LDPC decoding datas；6th step, internal layer RS decodings, carry out RS decodings to LDPC decoding datas, obtain RS decoded datas.Method of the present invention can realize figure encryption, ensure that figure can not be generated arbitrarily；Meanwhile there is function of data error correction, ensure the high fault tolerance during use, there is the characteristics of high reliability and high security.
Description
Technical Field
The invention belongs to the technical field of graph encryption, and particularly relates to a method for correcting and detecting graph encryption data.
Background
With the use of two-dimensional codes in a large amount in life, the graphical coding mode brings great convenience to the life of people, and due to the open source of the two-dimensional codes, the safety of the two-dimensional codes is more and more concerned by the society. At present, methods and apparatuses for performing a check on pattern-coded data by using parity check codes have been implemented, such as: liweiwei proposes a method for determining whether decoding is correct or not by using data parity in a graphic coded data verification method and system (Chinese patent 103166647.2013.06.19). The common point of the graphic coding technology is that the influence of damage on the graphic during printing and storage is overcome, and the wrong data is corrected through the coding technology. This common denominator requires that redundant bits be added to the transmitted data and that only one bit data errors cannot be corrected in order to take into account high fault tolerance.
In the application of the actual graphic coding system, the coding scheme is not public, and particularly after two layers of coding, the coding scheme is more difficult to crack, so that the graphic coding scheme can be applied to the actual system as a key.
Disclosure of Invention
The invention aims to provide a method for correcting and detecting the error of the graphic encrypted data with good use effect.
In order to solve the technical problems, the invention provides the following technical scheme: a method for correcting and detecting graphic encrypted data sequentially comprises the following steps:
firstly, inner RS coding is carried out, and input data are RS coded to generate binary RS coded data;
secondly, outer-layer LDPC coding, namely performing LDPC coding on the RS coded data generated in the step (1) to generate LDPC coded data;
thirdly, forming a dot-matrix chart, and pressing the data in the step (2)According to a set matrixM×NAnd converting to form a dot matrix diagram, wherein the conversion rule is as follows: bit 1 is mapped as a black dot, and bit 0 is not mapped;
fourthly, quantizing the dot matrix diagram to form quantized data; wherein, the quantization rule is as follows: extracting the brightness of the data bits, taking the average value of the brightness of all the data bits as a reference threshold value, dividing the data bits into two types, respectively averaging the brightness of the two types of data bits again, and thus corresponding to the high-brightness average value of bit 1 and the low-brightness average value of bit 0; taking the high brightness mean value of bit 1 as scalar 1, taking the low brightness mean value of bit 0 as scalar 0, and carrying out equal difference distance quantization according to the resolution of 0.01; finally, assigning equal difference values of all the brightness;
fifthly, outer-layer LDPC decoding, namely performing LDPC decoding on the quantized data to generate LDPC decoded data;
and sixthly, inner layer RS decoding, wherein the LDPC decoding data is subjected to RS decoding to obtain RS decoded data.
The inner RS encoding includes the following steps:
(1) mapping the input data to a Galois field generation information element;
(2) dividing the information element and the generator polynomial to obtain a residue equation, wherein the residue equation is used as an RS (RS) coding check bit, the information element is used as an RS (3) coding data bit, and the RS coding check bit and the RS coding data bit are combined into RS coding data;
the method for obtaining the generator polynomial comprises the following steps:
1) data to be inputted withmEach bit is converted into decimal data according tomObtaining a primitive polynomial;
2) calculating corresponding elements of the primitive polynomial in the Galois field;
3) a generator polynomial is obtained from the primitive polynomial.
In the process of generating the polynomial, it is necessary toTo determine the number of error correction bits t of the RS encoding, according to the formula g (x) = (x-a)2）......（x-a2t) Obtaining a generator polynomial, wherein g (x) is the generator polynomial,xto generate a polynomial variable;ato generate a polynomial heel;tis the number of error correction bits.
The outer LDPC encoding comprises the following steps:
(1) ensuring RS coded data as binary data, if not converting RS coded data into lengthmObtaining input binary data by the binary data group, wherein the input binary data are LDPC coded data bits;
(2) multiplying input binary data by a generating matrix to obtain LDPC coded check bits, and combining the LDPC coded data bits and the LDPC coded check bits to form LDPC coded data;
the obtaining of the generating matrix comprises the following steps:
1) setting LDPC parameters, wherein the LDPC parameters comprise row number, column number, row weight and column weight; generating a sparse matrix according to the LDPC parameters;
2) obtaining a parity check matrix according to the sparse matrix;
3) and factoring the parity check matrix to obtain a generator matrix.
In the step of forming the bitmap, the LDPC coded data is rectangular-shapedM×NIn the process of conversion, if the bit number of the last line is less thanNThe insufficient number of bits is zero-padded.
The outer LDPC decoding includes the steps of:
A. multiplying the quantized data by the parity check matrix to obtain an external likelihood ratio matrix;
B. obtaining a total likelihood ratio data group L according to the external likelihood ratio matrix;
C. converting the total likelihood ratio data group L into a binary data group z, wherein the conversion rule is as follows: when the element in the total likelihood ratio data group L is greater than 0, the corresponding element in the binary data group z is 0, and when the element in the total likelihood ratio data group L is less than 0, the corresponding element in the binary data group z is 1;
D. multiplying the parity check matrix by elements in a binary data group z, judging whether the parity check matrix is 0, and outputting data if the parity check matrix is 0 to form LDPC decoding data; if not, iteration is carried out, and the iteration data in the step (A) is repeated until the iteration times are reached.
The inner layer RS decoding comprises the following steps:
(1) obtaining a syndrome polynomial from the LDPC decoded data and the generator polynomial;
(2) constructing an error polynomial from the syndrome polynomial;
(3) by a maximum number of iterations of2tThe error position is calculated through iteration;
(4) an error value is determined.
Through the technical scheme, the invention has the beneficial effects that: the method of the invention can realize graph encryption, can realize the data error correction function under the condition of strong noise, and has the characteristics of high reliability and high safety.
Drawings
FIG. 1 is a flow chart of an inner RS encoding method;
FIG. 2 is a flow chart of an outer LDPC encoding method;
FIG. 3 is a flow chart of an outer LDPC decoding method;
fig. 4 is a flowchart of an inner RS decoding method.
Detailed Description
A method for correcting and detecting graphic encrypted data sequentially comprises the following steps as shown in figures 1-4:
the first step, inner RS coding, RS coding the data processed by the block, specifically: RS coding is carried out on input data to generate binary RS coded data; wherein, the inner RS coding comprises the following steps:
(1) mapping the input data to a Galois field generation information element;
(2) and dividing the information element by the generator polynomial to obtain a residue equation, wherein the residue equation is used as an RS (RS) coding check bit, the information element is used as an RS (3) coding data bit, and the RS coding check bit and the RS coding data bit are combined into RS coding data.
The method for obtaining the generator polynomial comprises the following steps:
1) data to be inputted withmEach bit is converted into decimal data according tomObtaining a primitive polynomial; wherein,mthe value is a selected value.
2) Calculating corresponding elements of the primitive polynomial in the Galois field;
3) a generator polynomial is obtained from the primitive polynomial.
In the process of generating the polynomial, the error correction bit number t of the RS code needs to be determined according to the formula g (x) = (x-a)2）......（x-a2t) Obtaining a generator polynomial, wherein g (x) is the generator polynomial, and x is a variable of the generator polynomial; a is a heel for generating a polynomial; t is the number of error correction bits.
Secondly, outer-layer LDPC coding, namely performing LDPC coding on the RS coded data generated in the step (1) to generate LDPC coded data;
wherein, the outer LDPC coding comprises the following steps:
(1) ensuring that the RS encoding data is binary data, if not, converting the RS encoding data into a binary data group with the length of m to obtain input binary data, wherein the input binary data is LDPC encoding data bits; the conversion of RS encoded data and bi-level data is prior art.
(2) And multiplying the input binary data by the generating matrix to obtain LDPC coded check bits, and combining the LDPC coded data bits and the LDPC coded check bits to form the LDPC coded data.
The obtaining of the generating matrix comprises the following steps:
1) setting LDPC parameters, wherein the LDPC parameters comprise row number, column number, row weight and column weight; generating a sparse matrix according to the LDPC parameters;
2) obtaining a parity check matrix according to the sparse matrix;
3) and factoring the parity check matrix to obtain a generator matrix.
And step three, forming a dot matrix diagram, and converting the data in the step (2) according to a set matrix M multiplied by N to form the dot matrix diagram, wherein the conversion rule is as follows: bit 1 is mapped as a black dot, and bit 0 is not mapped; the dot-matrix diagram generation method is the prior art. In the step of forming the bitmap, in the process of converting the LDPC coded data according to the rectangle M multiplied by N, if the bit number of the last line is less than N, the insufficient bit number is subjected to zero filling processing. The method for converting the data according to the set matrix comprises the following steps: the conversion is performed using a serial to parallel converter.
Fourthly, quantizing the dot matrix diagram to form quantized data; wherein, the quantization rule is as follows: extracting the brightness of the data bits, taking the average value of the brightness of all the data bits as a reference threshold value, dividing the data bits into two types, respectively averaging the brightness of the two types of data bits again, and thus corresponding to the high-brightness average value of bit 1 and the low-brightness average value of bit 0; taking the high brightness mean value of bit 1 as scalar 1, taking the low brightness mean value of bit 0 as scalar 0, and carrying out equal difference distance quantization according to the resolution of 0.01; and finally, assigning the equal difference of all the brightness. The accuracy of data processing can be improved through the dot-matrix diagram quantization processing, the probability of error occurrence is reduced, and the high reduction of the original elements is realized.
And fifthly, outer-layer LDPC decoding, namely performing LDPC decoding on the quantized data to generate LDPC decoded data.
Wherein, the outer LDPC decoding comprises the following steps:
A. multiplying the quantized data by the parity check matrix to obtain an external likelihood ratio matrix;
B. obtaining a total likelihood ratio data group L according to the external likelihood ratio matrix;
C. converting the total likelihood ratio data group L into a binary data group z, wherein the conversion rule is as follows: when the element in the total likelihood ratio data group L is greater than 0, the corresponding element in the binary data group z is 0, and when the element in the total likelihood ratio data group L is less than 0, the corresponding element in the binary data group z is 1;
D. multiplying the parity check matrix by elements in a binary data group z, judging whether the parity check matrix is 0, and outputting data if the parity check matrix is 0 to form LDPC decoding data; and (4) if not, iterating, and repeating the iteration data in the step (A) until the iteration number is reached, wherein the iteration number is a set value.
And sixthly, inner layer RS decoding, wherein the LDPC decoding data is subjected to RS decoding to obtain RS decoded data.
Wherein, the inner layer RS decoding comprises the following steps:
(1) obtaining a syndrome polynomial from the LDPC decoded data and the generator polynomial;
(2) constructing an error polynomial from the syndrome polynomial;
(3) calculating the error position through iteration with the maximum iteration number of 2 t; wherein t is the error correction bit number of the RS code.
(4) And (5) obtaining an error value and finishing error correction.
The method of the invention can realize graph encryption and ensure that the graph can not be randomly generated; meanwhile, the method has the data error correction function, ensures high fault tolerance in the use process, and has the characteristics of high reliability and high safety.
Claims (7)
1. A method for error correction and detection of graphics encryption data, characterized by: the method sequentially comprises the following steps:
firstly, inner RS coding is carried out, and input data are RS coded to generate binary RS coded data;
secondly, outer-layer LDPC coding, namely performing LDPC coding on the RS coded data generated in the step (1) to generate LDPC coded data;
thirdly, forming a dot matrix chart, and enabling the data in the step (2) to be in accordance with a set matrixM×NAnd then the conversion is carried out to form a dot matrix diagram, wherein,the conversion rule is: bit 1 is mapped as a black dot, and bit 0 is not mapped;
fourthly, quantizing the dot matrix diagram to form quantized data; wherein, the quantization rule is as follows: extracting the brightness of the data bits, taking the average value of the brightness of all the data bits as a reference threshold value, dividing the data bits into two types, respectively averaging the brightness of the two types of data bits again, and thus corresponding to the high-brightness average value of bit 1 and the low-brightness average value of bit 0; taking the high brightness mean value of bit 1 as scalar 1, taking the low brightness mean value of bit 0 as scalar 0, and carrying out equal difference distance quantization according to the resolution of 0.01; finally, assigning equal difference values of all the brightness;
fifthly, outer-layer LDPC decoding, namely performing LDPC decoding on the quantized data to generate LDPC decoded data;
and sixthly, inner layer RS decoding, wherein the LDPC decoding data is subjected to RS decoding to obtain RS decoded data.
2. The method of error correction and detection of graphics encryption data according to claim 1, characterized by:
the inner RS encoding includes the following steps:
(1) mapping the input data to a Galois field generation information element;
(2) dividing the information element and the generator polynomial to obtain a residue equation, wherein the residue equation is used as an RS (RS) coding check bit, the information element is used as an RS (3) coding data bit, and the RS coding check bit and the RS coding data bit are combined into RS coding data;
the method for obtaining the generator polynomial comprises the following steps:
1) data to be inputted withmEach bit is converted into decimal data according tomObtaining a primitive polynomial;
2) calculating corresponding elements of the primitive polynomial in the Galois field;
3) a generator polynomial is obtained from the primitive polynomial.
3. The method of error correction and detection of graphics encryption data according to claim 2, characterized by:
in the process of generating the polynomial, the error correction bit number t of the RS code needs to be determined according to the formula g (x) = (x-a)2）......（x-a2t) Obtaining a generator polynomial, wherein g (x) is the generator polynomial,xto generate a polynomial variable;ato generate a polynomial heel;tis the number of error correction bits.
4. A method of error correction and detection of graphics encryption data according to any of claims 1 to 3, characterized by:
the outer LDPC encoding comprises the following steps:
(1) ensuring RS coded data as binary data, if not converting RS coded data into lengthmObtaining input binary data by the binary data group, wherein the input binary data are LDPC coded data bits;
(2) multiplying input binary data by a generating matrix to obtain LDPC coded check bits, and combining the LDPC coded data bits and the LDPC coded check bits to form LDPC coded data;
the obtaining of the generating matrix comprises the following steps:
1) setting LDPC parameters, wherein the LDPC parameters comprise row number, column number, row weight and column weight; generating a sparse matrix according to the LDPC parameters;
2) obtaining a parity check matrix according to the sparse matrix;
3) and factoring the parity check matrix to obtain a generator matrix.
5. Method for error correction and detection of graphics encryption data according to claim 1 or 4, characterized in that:
in the step of forming the bitmap, the LDPC coded data is rectangular-shapedM×NIn the process of conversion, if the bit number of the last line is less thanNThe insufficient number of bits is zero-padded.
6. The method of error correction and detection of graphics encryption data according to claim 5, wherein:
the outer LDPC decoding includes the steps of:
A. multiplying the quantized data by the parity check matrix to obtain an external likelihood ratio matrix;
B. obtaining a total likelihood ratio data group L according to the external likelihood ratio matrix;
C. converting the total likelihood ratio data group L into a binary data group z, wherein the conversion rule is as follows: when the element in the total likelihood ratio data group L is greater than 0, the corresponding element in the binary data group z is 0, and when the element in the total likelihood ratio data group L is less than 0, the corresponding element in the binary data group z is 1;
D. multiplying the parity check matrix by elements in a binary data group z, judging whether the parity check matrix is 0, and outputting data if the parity check matrix is 0 to form LDPC decoding data; if not, iteration is carried out, and the iteration data in the step (A) is repeated until the iteration times are reached.
7. The method of error correction and detection of graphics encryption data according to claim 1 or 6, characterized by:
the inner layer RS decoding comprises the following steps:
(1) obtaining a syndrome polynomial from the LDPC decoded data and the generator polynomial;
(2) constructing an error polynomial from the syndrome polynomial;
(3) by a maximum number of iterations of2tThe error position is calculated through iteration;
(4) an error value is determined.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710667274.XA CN107424199B (en) | 2017-08-07 | 2017-08-07 | Method for correcting and detecting graphic encrypted data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710667274.XA CN107424199B (en) | 2017-08-07 | 2017-08-07 | Method for correcting and detecting graphic encrypted data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107424199A true CN107424199A (en) | 2017-12-01 |
| CN107424199B CN107424199B (en) | 2020-11-13 |
Family
ID=60437615
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710667274.XA Expired - Fee Related CN107424199B (en) | 2017-08-07 | 2017-08-07 | Method for correcting and detecting graphic encrypted data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107424199B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109379087A (en) * | 2018-10-24 | 2019-02-22 | 江苏华存电子科技有限公司 | The method that LDPC compiles bit rate according to flash memory component error rate modulation core |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101013931A (en) * | 2006-11-27 | 2007-08-08 | 北京创毅视讯科技有限公司 | Method and apparatus for channel coding and interleaving in mobile media broadcast |
| CN101087180A (en) * | 2006-06-08 | 2007-12-12 | 华为技术有限公司 | Decoding method, device and application of wireless channel |
| CN103269229A (en) * | 2013-05-24 | 2013-08-28 | 上海交通大学 | A Hybrid Iterative Decoding Method for LDPC-RS Two-Dimensional Product Codes |
| CN103778452A (en) * | 2014-01-10 | 2014-05-07 | 惠州Tcl移动通信有限公司 | Two-dimension code encoding method, two-dimension code decoding method, two-dimension code encoding system and two-dimension code decoding method based on mobile phone |
| CN104517089A (en) * | 2013-09-29 | 2015-04-15 | 北大方正集团有限公司 | Two-dimensional code decoding system and method |
| CN104899629A (en) * | 2015-06-12 | 2015-09-09 | 吴伟和 | Two-dimensional code image generation method based on radial basis function |
| CN106682716A (en) * | 2016-12-02 | 2017-05-17 | 上海思岭信息科技有限公司 | Two-dimensional code coding method adopting layered structure and decoding method thereof |
-
2017
- 2017-08-07 CN CN201710667274.XA patent/CN107424199B/en not_active Expired - Fee Related
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101087180A (en) * | 2006-06-08 | 2007-12-12 | 华为技术有限公司 | Decoding method, device and application of wireless channel |
| CN101013931A (en) * | 2006-11-27 | 2007-08-08 | 北京创毅视讯科技有限公司 | Method and apparatus for channel coding and interleaving in mobile media broadcast |
| CN103269229A (en) * | 2013-05-24 | 2013-08-28 | 上海交通大学 | A Hybrid Iterative Decoding Method for LDPC-RS Two-Dimensional Product Codes |
| CN104517089A (en) * | 2013-09-29 | 2015-04-15 | 北大方正集团有限公司 | Two-dimensional code decoding system and method |
| CN103778452A (en) * | 2014-01-10 | 2014-05-07 | 惠州Tcl移动通信有限公司 | Two-dimension code encoding method, two-dimension code decoding method, two-dimension code encoding system and two-dimension code decoding method based on mobile phone |
| CN104899629A (en) * | 2015-06-12 | 2015-09-09 | 吴伟和 | Two-dimensional code image generation method based on radial basis function |
| CN106682716A (en) * | 2016-12-02 | 2017-05-17 | 上海思岭信息科技有限公司 | Two-dimensional code coding method adopting layered structure and decoding method thereof |
Non-Patent Citations (4)
| Title |
|---|
| HUANG SHENG等: "Construction method of QC-LDPC codes based on multi-plicative group of finite field in optical communication", 《OPTOELECTRONICS LETTERS》 * |
| 方勇: "《分布式信源编码：基础与前沿》", 31 May 2015 * |
| 李雅琪: "二维乘积码在下一代数字电视广播中的应用", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 蒲策: "QR二维码编码译码算法研究及应用", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109379087A (en) * | 2018-10-24 | 2019-02-22 | 江苏华存电子科技有限公司 | The method that LDPC compiles bit rate according to flash memory component error rate modulation core |
| WO2020082447A1 (en) * | 2018-10-24 | 2020-04-30 | 江苏华存电子科技有限公司 | Method for adjusting ldpc encoding and decoding rate of kernel according to flash memory component error rate |
| CN109379087B (en) * | 2018-10-24 | 2022-03-29 | 江苏华存电子科技有限公司 | Method for LDPC to modulate kernel coding and decoding rate according to error rate of flash memory component |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107424199B (en) | 2020-11-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10992416B2 (en) | Forward error correction with compression coding | |
| CN108650057B (en) | A method, device and system for encoding and decoding | |
| KR101330132B1 (en) | Decoding of raptor codes | |
| US9203608B2 (en) | System for encrypting data with an error correction code | |
| US8694872B2 (en) | Extended bidirectional hamming code for double-error correction and triple-error detection | |
| RU2007105100A (en) | DEVICE AND METHOD FOR CODING AND DECODING OF BLOCK CODE OF SPARED PARITY CONTROL | |
| EP3602794B1 (en) | Check bit concatenated polar codes | |
| CN108282265B (en) | Error correction coding method, apparatus, device and computer readable storage medium | |
| CN109921803B (en) | Decoding Method of High Density Linear Block Code Based on Neural Network | |
| CN101288232B (en) | Methods and devices for decoding and encoding data | |
| CN110233728A (en) | A kind of continuous variable quantum key distribution data error-correcting method based on fountain codes | |
| CN101765976A (en) | Error detection device and error correction/error detection decoding device and method | |
| Mathew et al. | Hardware implementation of (63, 51) bch encoder and decoder for WBAN using LFSR and BMA | |
| EP3131219B1 (en) | Puncturing of ldpc codes | |
| CN107424199B (en) | Method for correcting and detecting graphic encrypted data | |
| US11050440B2 (en) | Encoder, decoder, encoding method and decoding method based on low-density parity-check code | |
| Spinner et al. | Construction of high-rate generalized concatenated codes for applications in non-volatile flash memories | |
| CN106936541B (en) | RS coding and byte interleaving method and system | |
| CN104320147B (en) | Raptor code method for unequal error protection of system | |
| Al-Hashemi et al. | A new lossless image compression technique based on Bose, Chandhuri and Hocquengham (BCH) codes | |
| CN108429553A (en) | Coding method, code device and the equipment of polarization code | |
| US20060227017A1 (en) | Information encoding by shortened reed-solomon codes | |
| CN104022786B (en) | Product code coding method | |
| WO2021061058A1 (en) | Noise and cyclic redundancy check aided list decoding of error correcting codes | |
| JP4224818B2 (en) | Encoding method, encoding apparatus, decoding method, and decoding apparatus |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 450011 Building 1, yard 40, North Ring Road, Jinshui District, Zhengzhou City, Henan Province Patentee after: China Unicom Digital Technology Co.,Ltd. Henan Branch Address before: 450011 Building 1, yard 40, North Ring Road, Jinshui District, Zhengzhou City, Henan Province Patentee before: HENAN BRANCH OF CHINA UNICOM SYSTEM INTEGRATION Ltd.,Corp. |
|
| CP01 | Change in the name or title of a patent holder | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20201113 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |