CN105871508A - Network coding and decoding method and system - Google Patents
Network coding and decoding method and system Download PDFInfo
- Publication number
- CN105871508A CN105871508A CN201610177923.3A CN201610177923A CN105871508A CN 105871508 A CN105871508 A CN 105871508A CN 201610177923 A CN201610177923 A CN 201610177923A CN 105871508 A CN105871508 A CN 105871508A
- Authority
- CN
- China
- Prior art keywords
- coding
- row
- code block
- decoding
- shift matrix
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0076—Distributed coding, e.g. network coding, involving channel coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0061—Error detection codes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention provides a network coding and decoding method and system, and belongs to the technical field of computers. The network decoding process comprises the following steps of obtaining a sub-matrix T- of a shift matrix T, wherein the sub-matrix T- is composed of rows where system code blocks representing invalidation are and columns where check code blocks representing survival are; starting extracting the minimum number of each row, which is in the column different from the previously selected value, in the sub-matrix T-, wherein the selected value in each row represents the starting position of code fetch of the check code block corresponding to the row, and then extracting the front L bits of a check code pack from the starting position; and substituting the bits one by one for decoding based on the extracted data elements of the survived check code blocks and the survived system code blocks. The network coding and decoding method and system has the beneficial effects that the transmission bandwidth in the decoding process is reduced, the coding and decoding time delay is shortened greatly, and the coding and decoding efficiency is increased.
Description
Technical field
The present invention relates to field of computer technology, particularly relate to a kind of network decoding method and system.
Background technology
Along with the fast development of cloud computing, network encoding and decoding application in distributed memory system causes to be paid close attention to widely.
Network encoding and decoding can save memory space, reduces the network congestion that data are repaired.Network encoding and decoding are usual the most in the following way:
Ultimate range can divide (MDS) character: in order to maximum capacity tolerates inefficacy memory node quantity, has the code of MDS character
It is widely used.The former data of k packet are mapped to n (n >=k) grouped data, and wherein in these n data, any k is individual all may be used
To rebuild former n grouped data completely.I.e. original information stream is split into k isometric packet and is encoded into n number
According to bag, any k in this n packet can be recovered raw information.The meaning between the lines, as long as remaining intact node
Number can recover original data no less than k.
Suo Luomen (RS) code is a kind of code with MDS character, is widely used in the distributed memory system of network code
In.The defect of RS code is that its coding-decoding operation is applied at high system finite field, has higher encoding and decoding complexity, needs
Want complicated coding and decoding technology；Longer encoding and decoding time delay, needs the decoding time long；Energy consumption is high.The solution in high system territory
Code complexity is high, and the most now extensive work all concentrates on binary network coding and sawtooth (zigzag) decodes.
Zigzag decodes: zigzag decoding in binary field, the cube computing in decoding is become linear operation, fall
Low computational complexity.Zigzag decode (ZD) code, uses the zigzag in binary field to decode exactly.
The applicant, in the patent document of the Application No. 201510354829 applied for before, relates to the side of a kind of network code
Method, this kind of method is namely based on zigzag decode (ZD) code and improves, and the cataloged procedure in the method includes walking as follows
Rapid:
The first step, is divided into original message k isometric packet, uses C respectively1, C2..., CkRepresent, each number
It is L, wherein C according to packet lengthiIn data element Si,j{ 0,1} represents C to ∈iIn jth position, i ∈ 1,2,3 ..., k},
j∈{0,1,2,...,L-1}；
Second step, takes systematic code framework C1, C2..., CkFor k original non-coding bag, contain all of original
Message, it is the basis of rear n-k check code bag；
3rd step, coding checkout code block, rear n-k is referred to as check code bag, uses Ck+1,Ck+2,...,CnRepresent, by front
The code word that after k non-coding bag displacement, XOR generates by turn is constituted, and n packet is finally respectively stored in n individual independent
On node.
Zigzag decode (ZD) code, owing to being the zigzag decoding in employing binary field, but in coding shift circulation
The check code resulted in is many multidigit redundancies than systematic code, therefore add transmission bandwidth when transmission.Particularly in verification
Code is bigger, and in the case of displacement is many, the transmission bandwidth of increase can not be ignored, and substantially prolongs the time delay of encoding and decoding, causes
Encoding and decoding time lengthening.
Summary of the invention
For solving the problems of the prior art, the present invention provides a kind of network decoding method and system.
Inventive network decoding method includes cataloged procedure and decoding process, and described cataloged procedure comprises the steps:
The first step, dividing system code block, original message is divided into k isometric systematic code packet, uses C respectively1, C2...,
CkRepresenting, the data packet length of each systematic code is L, wherein CiIn data element Si,j{ 0,1} represents C to ∈iIn jth
Position, i ∈ 1,2,3 ..., k}, j ∈ 0,1,2 ..., L-1}；
Second step, coding checkout code block, it is provided with m check code bag after original non-coding bag, uses Ck+1,Ck+2,...,CnTable
Show, be made up of, wherein according to the code word that after the numerical shift in shift matrix T, XOR generates by turn front k non-coding bag
M=n-k；Finally n packet is respectively stored on n independent node,
Described decoding process comprises the steps:
Step one: obtain the submatrix T of shift matrix T-, wherein, submatrix T-The system code block place row lost efficacy by representative
Formed with representing verification code block column of surviving；
Step 2: from submatrix T-The middle number extracting different ranks, all several sums making acquirement are minimum, the selected value often gone
Represent this row corresponding verification code block code fetch original position, then from original position extract check code bag front L position；
Step 3: the data element of verification code block and the system code block of survival according to the survival extracted substitute into decoding by turn.
The present invention is further improved, and in second step, described shift matrix T is cyclic permutation matrices or incremental shift matrix,
In order to ensure zigzag decoding and MDS character, each element in non-coding bag is moved to right finger by shift matrix row vector
Location, the element after then moving to right is by arranging XOR by turn, and wherein, in shift matrix T, any row or row all do not have
Identical numeral；The element that the difference of any two row is comprised is different from.
The present invention is further improved, and the specific bit such as shift matrix T that each non-coding element is moved to right by row vector represents,
In matrix, the (i, j) individual element representation is to coding bag Ci+kIn the figure place of jth row element dextroposition, completed by this rule
To Ci+kCoding, i ∈ 1,2,3 ..., n-k}, j ∈ 1,2,3 ..., k}.
The present invention is further improved, and in shift matrix T, the numeral that often row is maximum is p, then, the verification that often row is corresponding
The a length of L+p of coding bag.
The present invention is further improved, and in step one, the summation of the systematic code block sum check code block of survival is no less than
Present invention also offers a kind of system realizing said method, including coding module and decoder module, described coding module
Including:
System code block division unit, for original message is divided into k isometric systematic code packet, uses C respectively1,
C2..., CkRepresenting, the data packet length of each systematic code is L, wherein CiIn data element Si,j{ 0,1} represents C to ∈i
In jth position, i ∈ 1,2,3 ..., k}, j ∈ 0,1,2 ..., L-1}；
Verification code block coding unit, for arranging m check code bag after original non-coding bag, uses Ck+1,Ck+2,...,Cn
Represent, be made up of, wherein according to the code word that after the numerical shift in shift matrix T, XOR generates by turn front k non-coding bag
M=n-k；Finally n packet is respectively stored on n independent node,
Described decoder module includes:
Acquiring unit: for obtaining the submatrix T of shift matrix T-, wherein, submatrix T-The system code block lost efficacy by representative
It is expert at and is represented survival verification code block column and formed；
Extraction unit: for from submatrix T-The middle number extracting different ranks, all several sums making acquirement are minimum, often go
Selected value represents the original position at verification code block code fetch corresponding to this row, then extracts before check code bag from original position
L position；
Decoding unit: the data element of verification code block and the system code block of survival according to the survival extracted substitute into solution by turn
Code.
The present invention is further improved, and in verification code block coding unit, described shift matrix T is cyclic permutation matrices or passs
Increase shift matrix, in order to ensure zigzag decoding and MDS character, each element in non-coding bag is pressed shift matrix
Row vector moves to right specific bit, and the element after then moving to right is by arranging XOR by turn, wherein, in shift matrix T, and any row
Or row all do not have identical numeral；The element that the difference of any two row is comprised is different from.
The present invention is further improved, and the specific bit such as shift matrix T that each non-coding element is moved to right by row vector represents,
In matrix, the (i, j) individual element representation is to coding bag Ci+kIn the figure place of jth row element dextroposition, completed by this rule
To Ci+kCoding, i ∈ 1,2,3 ..., n-k}, j ∈ 1,2,3 ..., k}.
The present invention is further improved, and in shift matrix T, the numeral that often row is maximum is p, then, the verification that often row is corresponding
The a length of L+p of coding bag.
The present invention is further improved, in the acquiring unit of decoder module, and the summation of the systematic code block sum check code block of survival
It is no less than
Compared with prior art, the invention has the beneficial effects as follows: on the basis of existing zigzag encoding and decoding, decoding process is entered
Go reformed AHP, reduced the transmission bandwidth during decoding, substantially reduce the time delay of encoding and decoding, improve encoding and decoding
Efficiency.
Accompanying drawing explanation
Fig. 1 is ZD-MDS of the present invention (8,4) code code pattern；
Fig. 2 is first embodiment of the invention decoding figure；
Fig. 3 is the submatrix T of second embodiment of the invention shift matrix T-Generate schematic diagram；
Fig. 4 is second embodiment of the invention decoding figure；
Fig. 5 is the submatrix T of third embodiment of the invention shift matrix T-Generate schematic diagram；
Fig. 6 is third embodiment of the invention decoding figure；
Fig. 7 is the submatrix T of fourth embodiment of the invention shift matrix T-Generate schematic diagram；
Fig. 8 is fourth embodiment of the invention decoding figure.
Detailed description of the invention
With embodiment, the present invention is described in further details below in conjunction with the accompanying drawings.
The present invention includes cataloged procedure and decoding process, and described cataloged procedure comprises the steps:
The first step, dividing system code block, original message is divided into k isometric systematic code packet, uses C respectively1, C2...,
CkRepresenting, the data packet length of each systematic code is L, wherein CiIn data element Si,j{ 0,1} represents C to ∈iIn jth
Position, i ∈ 1,2,3 ..., k}, j ∈ 0,1,2 ..., L-1}；
Second step, coding checkout code block, it is provided with m check code bag after original non-coding bag, uses Ck+1,Ck+2,...,CnTable
Show, be made up of, wherein according to the code word that after the numerical shift in shift matrix T, XOR generates by turn front k non-coding bag
M=n-k；Finally n packet is respectively stored on n independent node,
Described decoding process comprises the steps:
Step one: obtain the submatrix T of shift matrix T-, wherein, submatrix T-The system code block place row lost efficacy by representative
Formed with representing verification code block column of surviving；
Step 2: from submatrix T-The middle number extracting different ranks, all several sums making acquirement are minimum, the selected value often gone
Represent this row corresponding verification code block code fetch original position, then from original position extract check code bag front L position；
Step 3: the data element of verification code block and the system code block of survival according to the survival extracted substitute into decoding by turn.
As it is shown in figure 1, the raw information of the present invention is divided into four isometric packets, use C respectively1, C2, C3,C4Represent,
The data packet length of each systematic code is L, wherein CiIn data element Si,j{ 0,1} represents C to ∈iIn jth position,
i∈{1,2,3,...,k},j∈{0,1,2,...,L-1}。
Then, coding checkout code block, it is provided with 4 check code bags after original non-coding bag, uses C5,C6,C7,C8Represent,
It is made up of, finally by 8 according to the code word that after the numerical shift in shift matrix T, XOR generates by turn front 4 non-coding bags
Packet is respectively stored on 8 independent nodes.Wherein, the specific bit that each non-coding element is moved to right by row vector is such as
Shift matrix T represents, in matrix, the (i, j) individual element representation is to coding bag Ci+kIn the figure place of jth row element dextroposition,
Completed C by this rulei+kCoding, i ∈ 1,2,3 ..., n-k}, j ∈ 1,2,3 ..., k}, the shift matrix T of this example
For:
In verification code block coding unit, described shift matrix T is cyclic permutation matrices or incremental shift matrix, in order to ensure
Zigzag decoding and MDS character, move to right specific bit by shift matrix row vector, so by each element in non-coding bag
After will move to right after element by arranging XOR by turn, wherein, in shift matrix T, any row or row all there is no identical number
Word；The element that the difference of any two row is comprised is different from.
Such as: the first row (0,1,3,2) represents coding bag C5Middle structural element C1To C4Ring shift right 0,1 respectively,
3,2, it can be seen that the element of every a line and every string is all changed according to element corresponding in this matrix, obtained
Coding result as it is shown in figure 1, in FIG, the every string in coding bag represent relevant figure place different or result, such as C5
First be s1,0, second is S1,1With S2,0The result of XOR, stores after XOR the most by turn.
In the coded method of this example, the first row of the every a line of shift matrix to the 4th column element represents system code block C1 to C4 and divides
The figure place not shifted.Shift matrix first walk to fourth line respectively represent verification code block C5 to C8, a length of L+p (p for number
According to bag), length L of this example packet takes 10, and expense is 3.If it is relatively many to shift bigger or verification code block
In the case of, the transmission bandwidth of increase will be considerable, because the decoding process of this example is only from each verification code block L position,
Transmission bandwidth can be effectively reduced, increase decoding efficiency.
As in figure 2 it is shown, as first embodiment of this example, it is assumed that 4 verification code blocks of surviving:
So submatrix T-The system code block place row lost efficacy by representative and representative survival verification code block column are formed, because
System code block all lost efficacy, and verified code block and all survive, therefore, in such cases, and submatrix T-With shift matrix T etc.
With.
According to submatrix T-Numerical value, determine extract check code bag original position, from submatrix T-The different ranks of middle extraction
Number, all several sums making acquirement are minimum, and i.e. every provisional capital is O, and these O are respectively at different row, therefore from
First starts to take, and namely takes C5To C8The 1st to 10, check C5To C8, their first is " dew "
Out, it is C respectively1To C4First, the most do not carried out computing with the position of other code blocks；Then by C2First
Substitute into C5, C can be solved1Second, in like manner, by C3First substitution C6, C can be solved2Second, by C4
First substitution C7, C can be solved3Second, by C1First substitution C8, C can be solved4Second.Then,
By C4First and C2Second substitute into C5C can be solved1The 3rd, in like manner, circulate successively, C can be solved1To C4
All positions, obtain raw information, complete decoding, the numeral in each data element upper right corner is the concrete order decoded.
As shown in Figure 3 and Figure 4, decode the second embodiment of process as the present invention, it is assumed that survive three system code blocks and
One verification code block:
Assume that survival code block is C3, C6, C7, C8, decoding process is as follows:
Step one: obtain the submatrix T of shift matrix T-；Now submatrix T-Only three row three row compositions；
Step 2: extract submatrix T-In the number of every row different lines, make all numbers of acquirement and for minima, the first behavior 0,
Second behavior 1, the third line is 0, but 0 and second row 1 at same string, therefore abandon, look for the second little number, the most just
1, wherein, 1 and formerly choose 0 and 1 the most not at same string, therefore, 3 fetch bit initial value such as Fig. 3 chosen
Matrix T-Shown in frame.Then according to fetch bit rule takes 10 of verification code block of surviving, it is, take C6The 1st to 10
Position, C7The 2nd to 11, C8The 2nd to 11.
Step 3: the data element of verification code block and the system code block of survival according to the survival extracted substitute into decoding by turn.
First check, C2First spill, be not required to computing, can solve.Next C3First substitution C6Second
Position can solve C2Second, C3Second substitute into C7Second, solve C4First, C2First
Position and C3The 3rd substitution C7The 3rd can solve C4Second, C4Second substitute into C8Second, can
Solve C1First；Next C1First and C3Second substitute into C6The 3rd, C can be solved2The 3rd
Position, C1First, C2Second and C3The 4th substitution C7The 4th can solve C4The 3rd, C3
First and C4The 3rd substitution C8The 3rd can solve C1Second.According to each data element upper right corner
Digital number, can solve C1、C2、C4All figure places.
As shown in Figure 5 and Figure 6, decode the third embodiment of process as the present invention, it is assumed that survive two system code blocks and
Two verification code blocks:
Assume that survival code block is C1, C2, C5, C6, decoding process is as follows:
Step one: obtain the submatrix T of shift matrix T-；Now submatrix T-Only two row two row compositions；
Step 2: from submatrix T-The middle number extracting different ranks, all several sums making acquirement are minimum, the first behavior 2,
Second behavior 1, wherein 2 and 1 in different lines, then according to fetch bit rule takes 10 of verification code block of surviving, it is,
Take C5The 3rd to the 12nd, take C6The 2nd to the 11st.
Step 3: the data element of verification code block and the system code block of survival according to the survival extracted substitute into decoding by turn.
C1The 3rd, C2Second substitute into C5The 3rd can solve C4First, C2Second substitute into C6?
Two can solve C3First；C1First and C2The 3rd substitution C6The 3rd can solve C3Second, C1
Second, C2The 4th and C4First substitution C6The 4th can solve C3The 3rd.By that analogy, according to
C5, C6The digital number in each upper right corner of data element can solve C3And C4Each.
As shown in Figure 7 and Figure 8, decode the third embodiment of process as the present invention, it is assumed that survive three system code blocks and
One verification code block:
Assume that survival code block is C1, C2, C3, C5, decoding process is as follows:
Step one: obtain the submatrix T of shift matrix T-；Now submatrix T-Only a line one numeral composition；
Step 2: extract submatrix T-In every row minimum number, the most unique numeral 2, then according to fetch bit is regular
Take 10 of verification code block of surviving, it is, take C5The 3rd to the 12nd.
Step 3: the data element of verification code block and the system code block of survival according to the survival extracted substitute into decoding by turn.
Due to C1, C2, C3Each both know about, directly with C4Each carry out computing corresponding position substitute into C5, can solve
Go out C4Each.And then decode origination message.According to C5The digital number in each upper right corner of data element can solve C4
Each.
Certainly, if the nodes survived is the most, then it is the easiest to decode.
In order to ensure that coding can solve, the summation of the systematic code block sum check code block of the survival of this example is no less thanWherein n
For coding bag and the sum of non-coding bag.
This example is applicable not only to the coded method that this example is introduced, and applies also for the decoding of any application zigzag coding.
Present invention also offers a kind of system realizing above-mentioned network decoding method, including coding module and decoder module, institute
State coding module to include:
System code block division unit, for original message is divided into k isometric systematic code packet, uses C respectively1,
C2..., CkRepresenting, the data packet length of each systematic code is L, wherein CiIn data element Si,j{ 0,1} represents C to ∈i
In jth position, i ∈ 1,2,3 ..., k}, j ∈ 0,1,2 ..., L-1}；
Verification code block coding unit, for arranging m check code bag after original non-coding bag, uses Ck+1,Ck+2,...,Cn
Represent, be made up of, wherein according to the code word that after the numerical shift in shift matrix T, XOR generates by turn front k non-coding bag
M=n-k；Finally n packet is respectively stored on n independent node,
Described decoder module includes:
Acquiring unit: for obtaining the submatrix T of shift matrix T-, wherein, submatrix T-The system code block lost efficacy by representative
It is expert at and is represented survival verification code block column and formed；
Extraction unit: for from submatrix T-The middle number extracting different ranks, all several sums making acquirement are minimum, often go
Selected value represents the original position at verification code block code fetch corresponding to this row, then extracts before check code bag from original position
L position；
Decoding unit: the data element of verification code block and the system code block of survival according to the survival extracted substitute into solution by turn
Code.
In verification code block coding unit, described shift matrix T is cyclic permutation matrices or incremental shift matrix, in order to ensure
Zigzag decoding and MDS character, move to right specific bit by shift matrix row vector, so by each element in non-coding bag
After will move to right after element by arranging XOR by turn, wherein, in shift matrix T, any row or row all there is no identical number
Word；The element that the difference of any two row is comprised is different from.
The present invention is in binary field, by shift matrix, shifts, and origination message is carried out coding and makes it have MDS
(n, k) character, then use sawtooth pattern (zigzag) decoding technique, reduces decoding complex degree, reduces decoding simultaneously
During transmission bandwidth, substantially reduce the time delay of encoding and decoding, improve encoding-decoding efficiency.
The detailed description of the invention of the above is the better embodiment of the present invention, not limits being embodied as of the present invention with this
Scope, the scope of the present invention includes being not limited to this detailed description of the invention, and all equivalence changes made according to the present invention are all at this
In the protection domain of invention.
Claims (10)
1. a network decoding method, including cataloged procedure and decoding process, described cataloged procedure comprises the steps:
The first step, dividing system code block, original message is divided into k isometric systematic code packet, uses C respectively1, C2...,
CkRepresenting, the data packet length of each systematic code is L, wherein CiIn data element Si,j{ 0,1} represents C to ∈iIn
Jth position, i ∈ 1,2,3 ..., k}, j ∈ 0,1,2 ..., L-1}；
Second step, coding checkout code block, it is provided with m check code bag after original non-coding bag, uses Ck+1,Ck+2,...,CnTable
Show, be made up of according to the code word that after the numerical shift in shift matrix T, XOR generates by turn front k non-coding bag, its
Middle m=n-k；Finally n packet is respectively stored on n independent node,
It is characterized in that, described decoding process comprises the steps:
Step one: obtain the submatrix T of shift matrix T-, wherein, submatrix T-The system code block place row lost efficacy by representative
Formed with representing verification code block column of surviving；
Step 2: from submatrix T-The middle number extracting different ranks, all several sums making acquirement are minimum, the selected value often gone
Represent this row corresponding verification code block code fetch original position, then from original position extract check code bag front L
Position；
Step 3: the data element of verification code block and the system code block of survival according to the survival extracted substitute into solution by turn
Code.
Network decoding method the most according to claim 1, it is characterised in that: in second step, described shift matrix T
For cyclic permutation matrices or incremental shift matrix, in order to ensure zigzag decoding and MDS character, by non-coding bag
Each element move to right specific bit by shift matrix row vector, the element after then moving to right by arranging XOR by turn,
Wherein, in shift matrix T, any row or row all do not have identical numeral；The unit that the difference of any two row is comprised
Element is different from.
Network decoding method the most according to claim 2, it is characterised in that: each non-coding element is right by row vector
Specific bit such as the shift matrix T moved represents, in matrix, the (i, j) coding is wrapped C by individual element representationi+kIn jth row
The figure place of element right shift, is completed C by this rulei+kCoding, i ∈ 1,2,3 ..., n-k},
j∈{1,2,3,...,k}。
4. according to the network decoding method described in any one of claim 1-3, it is characterised in that: in shift matrix T, often go
Maximum numeral is p, then, the often a length of L+p of the check code bag that row is corresponding.
5. according to the network decoding method described in any one of claim 1-3, it is characterised in that: in step one, survival
The summation of systematic code block sum check code block is no less than
6. realize a system for network decoding method described in any one of claim 1-5, including coding module and decoder module,
Described coding module includes:
System code block division unit, for original message is divided into k isometric systematic code packet, uses C respectively1,
C2..., CkRepresenting, the data packet length of each systematic code is L, wherein CiIn data element Si,j∈ { 0,1} table
Show CiIn jth position, i ∈ 1,2,3 ..., k}, j ∈ 0,1,2 ..., L-1}；
Verification code block coding unit, for arranging m check code bag after original non-coding bag, uses Ck+1,Ck+2,...,Cn
Represent, be made up of according to the code word that after the numerical shift in shift matrix T, XOR generates by turn front k non-coding bag,
Wherein m=n-k；Finally n packet is respectively stored on n independent node,
It is characterized in that, described decoder module includes:
Acquiring unit: for obtaining the submatrix T of shift matrix T-, wherein, submatrix T-The system code block lost efficacy by representative
It is expert at and is represented survival verification code block column and formed；
Extraction unit: for from submatrix T-The middle number extracting different ranks, all several sums making acquirement are minimum, often go
Selected value represent this row corresponding verification code block code fetch original position, then from original position extract check code bag
Front L position；
Decoding unit: the data element of verification code block and the system code block of survival according to the survival extracted substitute into solution by turn
Code.
Network coding/decoding system the most according to claim 6, it is characterised in that: in verification code block coding unit, described
Shift matrix T is cyclic permutation matrices or incremental shift matrix, in order to ensure zigzag decoding and MDS character, and will
Each element in non-coding bag moves to right specific bit by shift matrix row vector, and the element after then moving to right is by row
XOR by turn, wherein, in shift matrix T, any row or row all do not have identical numeral；The difference of any two row
The element comprised is different from.
Network coding/decoding system the most according to claim 7, it is characterised in that: each non-coding element is right by row vector
Specific bit such as the shift matrix T moved represents, in matrix, the (i, j) coding is wrapped C by individual element representationi+kIn jth row
The figure place of element right shift, is completed C by this rulei+kCoding, i ∈ 1,2,3 ..., n-k},
j∈{1,2,3,...,k}。
9. according to the network coding/decoding system described in any one of claim 6-8, it is characterised in that: in shift matrix T, often go
Maximum numeral is p, then, the often a length of L+p of the check code bag that row is corresponding.
10. according to the network coding/decoding system described in any one of claim 6-8, it is characterised in that: at the acquisition list of decoder module
In unit, the summation of the systematic code block sum check code block of survival is no less than
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610177923.3A CN105871508B (en) | 2016-03-25 | 2016-03-25 | Network coding and decoding method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610177923.3A CN105871508B (en) | 2016-03-25 | 2016-03-25 | Network coding and decoding method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105871508A true CN105871508A (en) | 2016-08-17 |
| CN105871508B CN105871508B (en) | 2020-01-07 |
Family
ID=56625910
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610177923.3A Active CN105871508B (en) | 2016-03-25 | 2016-03-25 | Network coding and decoding method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105871508B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113114276A (en) * | 2021-04-22 | 2021-07-13 | 深圳大学 | Network coding and decoding method and device based on cyclic shift and related components |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060190801A1 (en) * | 2005-02-22 | 2006-08-24 | Samsung Electronics Co., Ltd. | Apparatus and method for generating low density parity check code using zigzag code in a communication system |
| WO2007029114A2 (en) * | 2005-09-08 | 2007-03-15 | Nokia Siemens Networks Oy | System, transmitter, receiver, method, and computer program product for structured interleaved zigzag coding |
| CN105356968A (en) * | 2015-06-24 | 2016-02-24 | 深圳大学 | Network coding method and system based on circulant permutation matrix |
| CN105356892A (en) * | 2015-06-24 | 2016-02-24 | 深圳大学 | Network coding method and system |
-
2016
- 2016-03-25 CN CN201610177923.3A patent/CN105871508B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060190801A1 (en) * | 2005-02-22 | 2006-08-24 | Samsung Electronics Co., Ltd. | Apparatus and method for generating low density parity check code using zigzag code in a communication system |
| WO2007029114A2 (en) * | 2005-09-08 | 2007-03-15 | Nokia Siemens Networks Oy | System, transmitter, receiver, method, and computer program product for structured interleaved zigzag coding |
| CN105356968A (en) * | 2015-06-24 | 2016-02-24 | 深圳大学 | Network coding method and system based on circulant permutation matrix |
| CN105356892A (en) * | 2015-06-24 | 2016-02-24 | 深圳大学 | Network coding method and system |
Non-Patent Citations (3)
| Title |
|---|
| 代明军等: ""A Small Overhead Storage Room MDS Code with Zigzag−decodable Property for Distributed Storage"", 《2013 IEEE GLOBAL HIGH TECH CONGRESS ON ELECTRONICS (GHTCE)》 * |
| 代明军等: ""Design of (4, 8) Binary Code with MDS and Zigzag-Decodable Property"", 《WIRELESS PERS COMMUN》 * |
| 陈军等: ""A New Zigzag MDS Code with Optimal Encoding and Efficient Decoding"", 《2014 IEEE INTERNATIONAL CONFERENCE ON BIG DATA》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113114276A (en) * | 2021-04-22 | 2021-07-13 | 深圳大学 | Network coding and decoding method and device based on cyclic shift and related components |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105871508B (en) | 2020-01-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105356968B (en) | The method and system of network code based on cyclic permutation matrices | |
| US8751902B2 (en) | Methods and apparatus for encoding LDPC codes | |
| CN110114978B (en) | Efficient decodable QC-LDPC codes | |
| CN105356892B (en) | The method and system of network code | |
| CN108132854B (en) | Erasure code decoding method capable of simultaneously recovering data elements and redundant elements | |
| CN105703782B (en) | A kind of network coding method and system based on incremental shift matrix | |
| CN101632230A (en) | Encoding and decoding of low density parity check (LDPC) codes | |
| CN1307804C (en) | Error correcting encoding equipment and method | |
| Shahabinejad et al. | A class of binary locally repairable codes | |
| CN111078460A (en) | Fast erasure code calculation method | |
| CN103746774A (en) | Error resilient coding method for high-efficiency data reading | |
| CN107241414A (en) | A kind of private information retrieval method and system decoded based on zigzag | |
| KR20150131541A (en) | encoding apparatus and encoding method thereof | |
| US10187084B2 (en) | Method of encoding data and data storage system | |
| CN108432170B (en) | Apparatus and method for multi-code distributed storage | |
| CN105871508A (en) | Network coding and decoding method and system | |
| CN107733441B (en) | Coding method and device, decoding method and device | |
| WO2017041232A1 (en) | Encoding and decoding framework for binary cyclic code | |
| CN108628697B (en) | Binary-based node repairing method and system | |
| CN108199720B (en) | Node repairing method and system for reducing storage overhead and improving repairing efficiency | |
| CN102244521A (en) | Blind identification method for coding parameter of return-to-zero Turbo code | |
| CN110990188B (en) | Construction method of partial repetition code based on Hadamard matrix | |
| CN101882972A (en) | Decoding method of Raptor code | |
| CN109242510A (en) | A kind of graphical information decoding method for commodity outer packing | |
| CN104393876A (en) | Parity check matrix, encoding method, encoder, decoding method and decoder |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201218 Address after: 030000 1 / F, skirt building, Huadun building, No.88, Fazhan Road, Jinyang street, Taiyuan Xuefu Park, Shanxi comprehensive reform demonstration zone, Taiyuan City, Shanxi Province Patentee after: Shanxi Jinchan e-commerce Co., Ltd Address before: 518000 No. 3688 Nanhai Road, Shenzhen, Guangdong, Nanshan District Patentee before: SHENZHEN University |
|
| TR01 | Transfer of patent right |