CN106788455A - A kind of building method of the optimal partial repairable system code based on bag - Google Patents
A kind of building method of the optimal partial repairable system code based on bag Download PDFInfo
- Publication number
- CN106788455A CN106788455A CN201611073014.1A CN201611073014A CN106788455A CN 106788455 A CN106788455 A CN 106788455A CN 201611073014 A CN201611073014 A CN 201611073014A CN 106788455 A CN106788455 A CN 106788455A
- Authority
- CN
- China
- Prior art keywords
- symbol
- partial
- system code
- code
- optimal
- 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
- 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/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of building method of the optimal partial repairable system code based on bag, its implementation is：A bag for being used to generate optimal partial repairable system code is constructed by the parameters of the object code for giving, then non-partial test symbol rank number n can be obtained by these parameters2Value；According to the n for obtaining2The size of value can be selected using two kinds of different method construct optimal partial repairable system codes.The present invention is by the division to set X in bag, reduce the number that the existing sign bit repaired is lost or participated in during damaging data in reparation failed disk, and then storage overhead is reduced, and renewal efficiency is reduced, it is optimal the local repairable system for ultimately generating code.
Description
Technical field
The invention belongs to coding techniques field, more particularly to a kind of construction of the optimal partial repairable system code based on bag
Method, can be used under distributed memory system being lost in disk failure node or damaged data reparation.
Background technology
Large-scale cloud storage and distributed file system have reached very big scale, and the elastomer block of such as Amazon is deposited
Storage EBS and Google file system GoogleFS.In this case, disk failure has become normality.In such systems, it is
Data during protection disk failure, conventional solution has two kinds.The first scheme is to be copied directly to not packet
Same disk, so as to ensure the integrality of information.This scheme is most simple but needs huge storage overhead.Second scheme
It is that can divide MDS yards of coding using ultimate range to the data for needing storage.In general, real system can preferentially select this side
Case.If k information symbol position is encoded to be extended to n sign bit, any information sign bit in k information symbol
When losing or damaging, ultimate range can divide MDS yards to only need to using k sign bit in existing n-1 sign bit, you can extensive
Loss of appearing again or the information symbol position damaged.The disks different with copying to are compared, ultimate range can divide MDS yards can be significant
Improve redundancy and reliability.Even so, one includes n sign bit, the ultimate range of k information symbol position can divide MDS yards
Shortcoming is there is also, i.e., no matter when is recovered a sign bit lost or damage and is required for taking out k existing symbol from disk
Position participates in repairing, and especially in large-scale distributed file system, ultimate range can divide MDS yards of storage overhead larger.
The content of the invention
For the deficiency that above-mentioned prior art is present, it is to propose a kind of optimal partial based on bag that the purpose of the present invention is
The building method of repairable system code, it is excessive with required storage overhead during solving the problems, such as distributed storage, reduce in magnetic
The number of the existing sign bit of reparation is participated in disk malfunctioning node repair process, is reduced and is updated efficiency.
To achieve these goals, the present invention is as follows using technical scheme：
A kind of building method of the optimal partial repairable system code based on bag, it is desirable to the optimal repairable system code of construction
It is object code, a bag for being used to generate optimal partial repairable system code is constructed by the parameters of the object code for giving,
Again by the non-partial test symbol rank number n2 of these parameter acquirings, the size according to n2 values can be selected using two kinds of different sides
Method construction optimal partial repairable system code, is specifically carried out as follows：
Step one：It is configured to generate the bag of optimal partial repairable system code；
Step 2：Fetching portion check character row number n1 and non-partial test symbol rank number n2；
Step 3：Obtain optimal partial repairable system code.
Further according to the building method of optimal partial repairable system code, generation is configured to described in step one
The bag of optimal partial repairable system code；
Described with bag for the dividing condition of original information data, one (k, R, 1) bag is come with two tuple (X, β)
Represent, wherein k represents that total k original information data needs to divide, i.e., the information symbol in original information data is total k, k
The collection of individual information symbol position composition is combined into X, and the subset available symbols B of X represents that symbol B is also referred to as block, can be with by element of block B
Obtain set β；
The set X is divided into different blocks, and without occuring simultaneously between block and block under the dividing mode, all pieces of union is just
It is set X, different blocks can have different element numbers, for the set β being made up of block B, all pieces of element in set β
Number is combined and just constitute set R, and the element of set R is for positive integer and maximum is no more than k；
If each block B has identical, element number r, set R can be designated as R={ r }, and r is represented to be had when in a code word
When one information symbol bit loss or damage, r sign bit in the existing n-1 sign bit of true form word is at most needed to participate in
The information symbol bit recovery that will can be lost or damage, now wraps (k, R, 1) and is equivalent to wrap (k, r, 1)；
Each dividing mode of set X can all obtain some blocks, the block that will be obtained under all dividing modes and together
Total block is just obtained, any one element of set X is represented with symbol a, if in total block, symbol a only goes out in t block
It is existing, then claim bag (k, R, 1) to be regular, it is designated as t- rules (k, R, 1) bags；
If the dividing mode of set X has u kinds, u >=2 then claim bag (X, β) to be decomposable, available symbols (k, R, 1；U) table
Show, it is clear that (k, R, 1；U) bag is u- rules (k, R, 1；U) wrap.
Further according to the building method of optimal partial repairable system code, fetching portion check character in step 2
Row number n1 and non-partial test symbol rank number n2；
If symbol G=(e1,e2,...,ek|p1,p2,...,pn-k) it is the generator matrix of object code, generator matrix G is by k × k
Unit matrix I and k × (n-k) P matrixes composition, unit matrix I respective column symbols ei represented, P matrixes respective column is accorded with
Number pi is represented, with symbol supp (pi) represent the set of the corresponding line number of all non-zero value in arranging of P matrixes i-th, symbol | supp (pi)
| represent the number of all non-zero value in the row of P matrixes i-th；
If the i-th row of P matrixes meet | supp (pi) |≤r, then the row can be designated as partial test symbol rank, symbol n1 is represented
The number of all partial test symbol ranks in one generator matrix G；
If the i-th row of P matrixes are unsatisfactory for | supp (pi) |≤r, then the row can be designated as non-partial test symbol rank, symbol n2
Represent the number of all non-partial test symbol ranks in a generator matrix G；
There is n sign bit for one, k information symbol, smallest hamming distance is (n, k, d) liner code of d, can
To obtain n1+n2+ k=n, wherein smallest hamming distance d represent in yard C the different quantity in correspondence position between any two code word
Minimum value；
According to the parameter of given object code, can obtainRepresent that n1 takes no more thanIt is whole
Number, symbol δ represents the minimum range minimum value of code resulting after a sign bit for deleting yard C, by n1+n2+ k=n can obtain non-
Partial test symbol rank number n2=n-n1-k。
Further according to the building method of optimal partial repairable system code, optimal partial is obtained described in step 3
Repairable system code, according to the size of non-partial test symbol rank number n2 values, n2=0 and n2>Corresponded to respectively when 0 a kind of optimal
The building method of local repairable system code generator matrix, optimal partial repairable system code can be obtained by generator matrix.
Further according to the building method of optimal partial repairable system code, non-partial test symbol rank number n2=
When 0, one data acquisition system X of construction only has a kind of bag of dividing mode (X, β), and data acquisition system X is divided into n1 block, with n1 block
It is the set β of element, is denoted as β={ B1,B2,...,Bn1, by each block B in βi(1≤i≤n1) line number is rewritten as k, row
Number is 1 k × 1 partial test symbol rank pi, is full 0 matrix when pi is initial, and i is the sequence number of corresponding blocks Bi；
If the element of i-th piece of corresponding set Bi can be expressed as Bi1,Bi2,...,Bi|Bi|, | Bi| it is the i-th set of blocks Bi
Element number, by the correspondence B in partial test symbol rank pii1,Bi2,...,Bi|Bi|Capable value is set to 1；
K × n that each several part check character row pi is rearranged in order1Submatrix is combined with (k × k) unit matrix,
Obtain the generator matrix G=(e of optimal partial repairable system code1,e2,...,ek|p1,p2,...,pn1)；
By k original information data symbol M=(m to be encoded1,m2,m3,...,mk) represent, M=(m1,m2,
m3,...,mk) information bit matrix of 1 × k is also referred to as, G represents the generator matrix of the optimal partial repairable system code of k × n, by
Expression formula M × G=C can obtain optimal partial repairable system code.
Further according to the building method of optimal partial repairable system code, non-partial test symbol rank number n2>0
When, can divide MDS yards of construction optimal partial repairable system code using decomposable and ultimate range,
The decomposition species of X is u in decomposable (X, β), and β is designated as respectively1,β2,...,βu, the u kind isolations β of Xu
In the elements that are included of i-th piece of Bui be designated as Bui1,Bui2,...,Bui|Bui|, | Bui| it is the number comprising element in i-th piece；
By βuIn i-th piece be rewritten as behavior k, k × 1 full 0 check character the row pui, the pui for being classified as 1 represent set X
I-th piece of row of conversion generation under u kind isolations；
By the B in puiui1,Bui2,...,Bui|Bui|Capable value is set to ultimate range successively can divide MDS yards of generation square
Battle array G'=(e1,e2,...,ek|p1,p2,...pn-k) in i-th arrange Bui1,Bui2,...,Bui|Bui|Capable value, its residual value is constant；
Each pui leus order is arranged into the k+1 to k+u that overall replacement ultimate range can divide in MDS yards of generator matrix G'
Row, obtain the generator matrix G of optimal partial repairable system code；
By k original information data symbol M=(m to be encoded1,m2,m3,...,mk) represent, M=(m1,m2,
m3,...,mk) information bit matrix of 1 × k is also referred to as, G represents the generator matrix of the optimal partial repairable system code of k × n, by
Expression formula M × G=C can obtain optimal partial repairable system code.
Compared with prior art, the present invention has following technique effect：
The building method of the optimal partial repairable system code based on bag proposed by the present invention, by set X in bag
Divide, reduce the number of the existing sign bit for participating in repairing in disk failure node repair process, and then reduce storage
Expense, reduces renewal efficiency, is optimal the local repairable system for ultimately generating code.Wherein, efficiency is updated to refer to when letter
There is a sign bit to change in breath sign bit, the maximum of the sign bit number of change is needed in code C.Efficiency is updated to be represented with t,
T >=d, as t=d, code C has optimal renewal efficiency.Here smallest hamming distance d represents right between any two code word in yard C
Answer the minimum value of the different quantity in position.
Brief description of the drawings
Fig. 1 is the flow chart of the building method of the optimal partial repairable system code based on bag of the present invention.
Specific embodiment
Technical scheme is described in detail below in conjunction with drawings and Examples, so that people in the art
Member can be more clearly understood from the solution of the present invention, but therefore not limit the scope of the invention.
As shown in figure 1, assuming that it is desired that construction optimal repairable system code be object code, by give object code it is each
Item parameter can construct a bag for being used to generate optimal partial repairable system code, then can obtain non-part by these parameters
Check character row number n2Value, according to the n for obtaining2The size of value can be selected using two kinds of optimal offices of different method constructs
Portion's repairable system code.A kind of building method specific steps of optimal partial repairable system code based on bag of the present invention are such as
Under：
Step one：It is configured to generate the bag of optimal partial repairable system code.
Dividing condition for original information data can be described using bag, and one (k, R, 1) bag can use a binary
Group (X, β) represents that wherein k represents that total k original information data needs to divide, i.e. information symbol in original information data
Total k, the collection of k information symbol position composition is combined into X.The subset available symbols B of X represents that symbol B is also referred to as block, is with block B
Element can obtain set β.A kind of dividing mode is given, corresponding data acquisition system X can just be divided into different blocks, the division
Without occuring simultaneously between block and block under mode, all pieces of union is exactly set X.Different blocks can have different element numbers,
For the set β being made up of block B, all pieces of element number is combined and just constitute set R in set β.It can be seen that set R
Element be no more than k for positive integer and maximum.
If each block B has identical, element number r, set R can be designated as R={ r }, and r is represented when in a code word
When having an information symbol bit loss or damaging, r sign bit in the existing n-1 sign bit of true form word is at most needed to participate in
The information symbol bit recovery that will can just lose or damage, now wraps (k, R, 1) and is equivalent to wrap (k, r, 1).Each of set X
Dividing mode can all obtain some blocks, and total block is obtained the block obtained under all dividing modes and just together, with symbol a tables
Show any one element of set X, if in total block, symbol a only occurs in t block, then claim bag (k, R, 1) to be rule
, it is designated as t- rules (k, R, 1) bags.If the dividing mode of set X has u kinds, u >=2 then claim bag (X, β) to be decomposable, can use
Symbol (k, R, 1；U) represent, it is clear that (k, R, 1；U) bag is u- rules (k, R, 1；U) wrap.
Given one, containing 8 data acquisition system X={ 1,2,3,4,5,6,7,8 } of element, its correspondence is provided by above-mentioned knowledge
Four kinds of zoned formats be respectively：
β1={ { 2,3,8 }, { 6,7,4 }, { 1,5 } }, β2={ { 3,4,1 }, { 7,8,5 }, { 2,6 } }
β3={ { 4,5,2 }, { 8,1,6 }, { 3,7 } }, β4={ { 5,6,3 }, { 1,2,7 }, { 4,8 } }
(X, β) is (8, { 3,2 }, 1；4) decomposable, wherein β are β1,β2,β3,β4Union.
Step 2：Fetching portion check character row number n1 and non-partial test symbol rank number n2.
If symbol G=(e1,e2,...,ek|p1,p2,...,pn-k) it is the generator matrix of object code, generator matrix G is by k × k
Unit matrix I and k × (n-k) P matrixes composition, unit matrix I respective column symbols ei represented, P matrixes respective column is accorded with
Number pi is represented.With symbol supp (pi) represent the set of the corresponding line number of all non-zero value in arranging of P matrixes i-th.Symbol | supp (pi)
| the number of all non-zero value in the row of P matrixes i-th is represented, if the i-th row of P matrixes meet | supp (pi) |≤r, then the row can be designated as
Partial test symbol rank, symbol n1 represents the number of all partial test symbol ranks in a generator matrix G；If the i-th of P matrixes
Row are unsatisfactory for | supp (pi) |≤r, then the row can be designated as non-partial test symbol rank, symbol n2 is represented in a generator matrix G
The number of all non-partial test symbol ranks.
There is n sign bit for one, k information symbol, smallest hamming distance is (n, k, d) liner code of d, can
To obtain n1+n2+ k=n, wherein smallest hamming distance d represent in yard C the different quantity in correspondence position between any two code word
Minimum value.According to the parameter of given object code, can obtainRepresent that n1 takes no more thanIt is whole
Number, here symbol δ represent the minimum range minimum value of resulting code after a sign bit for deleting yard C, by n1+n2+ k=n can
Obtain non-partial test symbol rank number n2=n-n1-k。
Step 3：Obtain optimal partial repairable system code.
According to the size of non-partial test symbol rank number n2 values (n2 values non-negative), n2 is that 0 and n2 is corresponded to respectively when being more than 0
A kind of building method of optimal partial repairable system code generator matrix, optimal partial can be obtained by generator matrix can repair be
System code.Each method is comprised the following steps that：
(3-1) is when non-partial test symbol rank number n2 is 0.
One data acquisition system X of construction only has a kind of bag of dividing mode (X, β), and under the dividing mode, data acquisition system X can be with
N1 block is divided into, the set β with n1 block as element is denoted as β={ B1,B2,...,Bn1, by each block B in βi(1≤i≤
n1) line number is rewritten as k, columns is 1 k × 1 partial test symbol rank pi, and for full 0 matrix, (i is corresponding blocks Bi when pi is initial
Sequence number).
If the element of i-th piece of corresponding set Bi can be expressed as Bi1,Bi2,...,Bi|Bi|(|Bi| it is the i-th set of blocks Bi
Element number), by the correspondence B in partial test symbol rank pii1,Bi2,...,Bi|Bi|Capable value is set to 1.
K × n that each several part check character row pi is rearranged in order1Submatrix is combined with (k × k) unit matrix,
Obtain the generator matrix G=(e of optimal partial repairable system code1,e2,...,ek|p1,p2,...,pn1)。
By k original information data symbol M=(m to be encoded1,m2,m3,...,mk) represent, M=(m1,m2,
m3,...,mk) it is also referred to as the information bit matrix of 1 × k.G represents the generator matrix of the optimal partial repairable system code of k × n, by
Expression formula M × G=C can obtain optimal partial repairable system code.
(3-2) is when non-partial test symbol rank number n2 is more than 0.
In this case, MDS yards of construction optimal partial repairable system code can be divided using decomposable and ultimate range,
Comprise the following steps that：
The decomposition species of X is u in decomposable (X, β), and β is designated as respectively1,β2,...,βu, the u kind isolations β of Xu
In the elements that are included of i-th piece of Bui be designated as Bui1,Bui2,...,Bui|Bui|, | Bui| it is the number comprising element in i-th piece.
By βuIn i-th piece be rewritten as behavior k, k × 1 full 0 check character the row pui, the pui for being classified as 1 represent set X
I-th piece of row of conversion generation under u kind isolations.
By the B in puiui1,Bui2,...,Bui|Bui|Capable value is set to ultimate range successively can divide MDS yards of generation square
Battle array G'=(e1,e2,...,ek|p1,p2,...pn-k) in i-th arrange Bui1,Bui2,...,Bui|Bui|Capable value, its residual value is constant.
Each pui leus order is arranged into the k+1 to k+u that overall replacement ultimate range can divide in MDS yards of generator matrix G'
Row, obtain the generator matrix G of optimal partial repairable system code.
By k original information data symbol M=(m to be encoded1,m2,m3,...,mk) represent, M=(m1,m2,
m3,...,mk) it is also referred to as the information bit matrix of 1 × k.G represents the generator matrix of the optimal partial repairable system code of k × n, by
Expression formula M × G=C can obtain optimal partial repairable system code.
Specific embodiment based on innovative principle of the present invention given below, it is assumed that wishing the optimal partial of construction can repair
Complex system code length n has 16 sign bits for 16, i.e. each code word.The letter of original information data in note distributed memory system
Breath sign bit digit k=8, note recover an information symbol position lost or damage at most need in r=3 code C it is existing its
His sign bit is participated in, and deletes minimum range at least δ=4 of resulting code after a code bit of yard C.
Embodiment one
In the step (3-1) when n2 is equal to 0.
Construction one is containing 8 data acquisition system X={ 1,2,3,4,5,6,7,8 } of element, it is assumed that the division side of data acquisition system X
Method only has one kind, and from step one, the division of 3- rules (8,3, a 1) bag can be designated as：
β={ { 2,3,8 }, { 3,4,1 }, { 4,5,2 }, { 5,6,3 }, { 6,7,4 }, { 7,8,5 }, { 8,1,6 }, { 1,2,7 } }
Partial test symbol rank number n1 can be expressed as：
Non- partial test symbol rank number n2 can be expressed as：
n2=n-n1- k=16-8-8=0.
1st block of set β is { 2,3,8 }, refers to the subset of X, the corresponding column vector of block the 2nd, 3, the value of 8 rows be
1, remaining row value is 0, is designated as { 0,1,0,0,0,0,0,1 }T.2nd to 8 piece sequentially generates 7 column vectors respectively, by 8 arrange to
Amount is sequentially placed into the right side of k × k unit matrixs, obtains the generator matrix of optimal partial repairable system code：
Embodiment two
In the step (3-2) when n2 is more than 0.
If ultimate range can divide MDS yards of generator matrix for W, i.e.,：
Construction one contains 8 data acquisition system X={ 1,2,3,4,5,6,7,8 } of element, from step one, it is assumed that data
The division methods of set X have two kinds, are designated as respectively：β1={ { 2,3,8 }, { 6,7,4 }, { 1,5 } }, β2={ 3,4,1 }, 7,8,
5},{2,6}}。
Partial test symbol rank number n1 can be expressed as：
Non- partial test symbol rank number n2 can be expressed as：
n2=n-n1- k-20-8-8=4 ＞ 0
Data acquisition system X has two kinds of dividing modes to be designated as β respectively1,β2, ultimate range can divide in MDS yards of generator matrix W
9th, 10 row will be replaced.Method is as follows：
β1, there are 2 three blocks, respectively { 2,3,8 }, { 6,7,4 }, { 1,5 }, then the matrix for substituting the 9th row in W is one
3 × 8 new matrix.The first row of new matrix the 2nd, 3, the value of 8 rows and the 2nd that the 9th in W arranges, 3, the value of 8 rows it is identical.Newly
The secondary series of matrix the 6th, 7, the 6th of the value of 4 rows and the 9th row in W the, 7, the value of 4 rows it is identical.Tertial the of new matrix
1st, the value of 5 rows and the 9th row in W the 1st, the value of 5 rows it is identical.
β1,β2There are three blocks, respectively { 3,4,1 }, { 7,8,5 }, { 2,6 }, then the matrix for substituting the 10th row in W is also
The new matrix of one 3 × 8.The the 3rd, 4, the in the value of 1 row and W the 10th of the first row of new matrix arrange the 3rd, 4, the value phase of 1 row
Together.The secondary series of new matrix the 7th, 8, the value of 5 rows and the 7th that the 10th in W arranges, 8, the value of 5 rows it is identical.The 3rd of new matrix
Row the 2nd, the 2nd, value of 6 rows is identical with the 10th in W arranges for the value of 6 rows.
Method more than, obtains 2 new matrixes, replaces in W the 9th, 10 to arrange with this 2 new matrixes and has just obtained most
The generator matrix of excellent local repairable system code：
The above is only and the preferred embodiment of the present invention is described, technical scheme is not limited to
This, any known deformation that those skilled in the art are made on the basis of major technique of the invention design belongs to the present invention
Claimed technology category, the specific protection domain of the present invention is defined by the record of claims.
Claims (6)
1. it is a kind of based on bag optimal partial repairable system code building method, it is characterised in that wish construction it is optimal can
Repair system code is object code, and constructing one by the parameters of the object code for giving is used to generate optimal partial and can repair and be
The bag of system code, then by the non-partial test symbol rank number n2 of these parameter acquirings, the size according to n2 values can select to use two
Different method construct optimal partial repairable system codes are planted, is specifically carried out as follows：
Step one：It is configured to generate the bag of optimal partial repairable system code；
Step 2：Fetching portion check character row number n1 and non-partial test symbol rank number n2；
Step 3：Obtain optimal partial repairable system code.
2. according to claim 1 optimal partial repairable system code building method, it is characterised in that described in step one
It is configured to generate the bag of optimal partial repairable system code；
Described with bag for the dividing condition of original information data, one (k, R, 1) bag carrys out table with two tuple (X, β)
Show, wherein k represents that total k original information data needs to divide, i.e., the information symbol in original information data is total k, k
The collection of information symbol position composition is combined into X, and the subset available symbols B of X represents that symbol B is also referred to as block, can be obtained by element of block B
To set β；
The set X is divided into different blocks, and without occuring simultaneously between block and block under the dividing mode, all pieces of union is exactly to collect
X is closed, different blocks there can be different element numbers, the set β being made up of block B, all pieces of element number combination in set β
Just constitute set R together, set R element is for positive integer and maximum is no more than k；
If each block B has identical, element number r, set R can be designated as R={ r }, and r is represented ought have one in a code word
Information symbol bit loss or when damaging, at most needs the r sign bit participation in the existing n-1 sign bit of true form word just can be with
The information symbol bit recovery that will be lost or damage, now wraps (k, R, 1) and is equivalent to wrap (k, r, 1)；
Each dividing mode of set X can all obtain some blocks, by the block obtained under all dividing modes and together must
To total block, any one element of set X is represented with symbol a, if in total block, symbol a only occurs in t block, then
Claim bag (k, R, 1) to be regular, be designated as t- rules (k, R, 1) bags；
If the dividing mode of set X has u kinds, u >=2 then claim bag (X, β) to be decomposable, available symbols (k, R, 1；U) represent,
Obviously (k, R, 1；U) bag is u- rules (k, R, 1；U) wrap.
3. the building method of optimal partial repairable system according to claim 1 or claim 2 code, it is characterised in that in step 2
Fetching portion check character row number n1 and non-partial test symbol rank number n2；
If symbol G=(e1, e2,...,ek|p1,p2,...,pn-k) for object code generator matrix, generator matrix G by k × k list
The P matrixes of bit matrix I and k × (n-k) are constituted, and unit matrix I respective column symbols ei is represented, P matrix respective columns symbol pi
Represent, with symbol supp (pi) represent the set of the corresponding line number of all non-zero value in arranging of P matrixes i-th, symbol | supp (pi) | table
Show the number of all non-zero value in the row of P matrixes i-th；
If the i-th row of P matrixes meet | supp (pi) |≤r, then the row can be designated as partial test symbol rank, symbol n1 represents one
The number of all partial test symbol ranks in generator matrix G；
If the i-th row of P matrixes are unsatisfactory for | supp (pi) |≤r, then the row can be designated as non-partial test symbol rank, symbol n2 is represented
The number of all non-partial test symbol ranks in one generator matrix G；
For one with n sign bit, k information symbol position, smallest hamming distance is (n, k, d) liner code of d, can be obtained
To n1+n2+ k=n, wherein smallest hamming distance d represent the minimum of the different quantity in correspondence position between any two code word in yard C
Value；
According to the parameter of given object code, can obtainRepresent that n1 takes no more thanInteger, symbol
Number δ represents the minimum range minimum value of code resulting after a sign bit for deleting yard C, by n1+n2+ k=n can obtain non-part
Check character row number n2=n-n1-k。
4. according to claim any one of 1-3 optimal partial repairable system code building method, it is characterised in that step
Optimal partial repairable system code is obtained described in three, according to the size of non-partial test symbol rank number n2 values, n2=0 and n2
>A kind of building method of optimal partial repairable system code generator matrix is corresponded to when 0 respectively, can obtain optimal by generator matrix
Local repairable system code.
5. the building method of optimal partial repairable system code according to claim 4, it is characterised in that non-partial test symbol
During number row number n2=0, one data acquisition system X of construction only has a kind of bag of dividing mode (X, β), and data acquisition system X is divided into n1
Individual block, the set β with n1 block as element, is denoted as β={ B1, B2,...,Bn1, by each block B in βi(1≤i≤n1) rewrite
For line number is k, columns is 1 k × 1 partial test symbol rank pi, is full 0 matrix when pi is initial, and i is the sequence number of corresponding blocks Bi；
If the element of i-th piece of corresponding set Bi can be expressed as Bi1, Bi2,...,Bi|Bi|, | Bi| it is the element of the i-th set of blocks Bi
Number, by the correspondence B in partial test symbol rank pii1,Bi2,...,Bi|Bi|Capable value is set to 1；
K × n that each several part check character row pi is rearranged in order1Submatrix is combined with (k × k) unit matrix, is obtained most
Generator matrix G=(the e of excellent local repairable system code1, e2,...,ek|p1,p2,...,pn1)；
By k original information data symbol M=(m to be encoded1, m2,m3,...,mk) represent, M=(m1, m2, m3,...,mk)
The also referred to as information bit matrix of 1 × k, G represents the generator matrix of the optimal partial repairable system code of k × n, by expression formula M × G
=C can obtain optimal partial repairable system code.
6. the building method of optimal partial repairable system code according to claim 4, it is characterised in that non-partial test symbol
Number row number n2>When 0, MDS yards of construction optimal partial repairable system code can be divided using decomposable and ultimate range,
The decomposition species of X is u in decomposable (X, β), and β is designated as respectively1,β2,...,βu, the u kind isolations β of XuIn
The element that i blocks Bui is included is designated as Bui1, Bui2,...,Bui|Bui|, | Bui| it is the number comprising element in i-th piece；
By βuIn i-th piece be rewritten as behavior k, k × 1 full 0 check character the row pui, the pui for being classified as 1 represent set X u kinds
I-th piece of row of conversion generation under isolation；
By the B in puiui1,Bui2,...,Bui|Bui|Capable value is set to ultimate range successively can divide MDS yards of generator matrix G'=
(e1, e2,...,ek|p1,p2,...pn-k) in i-th arrange Bui1,Bui2,...,Bui|Bui|Capable value, its residual value is constant；
The k+1 to k+u that each pui leus order is arranged into overall replacement ultimate range can divide in MDS yards of generator matrix G' is arranged, and is obtained
To the generator matrix G of optimal partial repairable system code；
By k original information data symbol M=(m to be encoded1, m2, m3,...,mk) represent, M=(m1, m2, m3,...,mk)
The also referred to as information bit matrix of 1 × k, G represents the generator matrix of the optimal partial repairable system code of k × n, by expression formula M × G
=C can obtain optimal partial repairable system code.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611073014.1A CN106788455B (en) | 2016-11-29 | 2016-11-29 | A kind of building method of the optimal partial repairable system code based on packet |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611073014.1A CN106788455B (en) | 2016-11-29 | 2016-11-29 | A kind of building method of the optimal partial repairable system code based on packet |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106788455A true CN106788455A (en) | 2017-05-31 |
| CN106788455B CN106788455B (en) | 2019-11-22 |
Family
ID=58904444
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611073014.1A Active CN106788455B (en) | 2016-11-29 | 2016-11-29 | A kind of building method of the optimal partial repairable system code based on packet |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106788455B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109522150A (en) * | 2018-10-17 | 2019-03-26 | 长安大学 | Adaptive collapsible section duplication code construction and fault repairing method based on hypergraph |
| CN113315525A (en) * | 2021-06-03 | 2021-08-27 | 长安大学 | Construction of local repair code based on hypercube and method for repairing fault code element |
| CN113381772A (en) * | 2021-07-02 | 2021-09-10 | 广东工业大学 | Packet-based optimal local repair code construction method |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100153822A1 (en) * | 2008-12-15 | 2010-06-17 | Microsoft Corporation | Constructing Forward Error Correction Codes |
| CN101834899A (en) * | 2010-04-29 | 2010-09-15 | 中科院成都信息技术有限公司 | Distributed adaptive coding and storing method |
| CN103209210A (en) * | 2013-03-04 | 2013-07-17 | 华中科技大学 | Method for improving erasure code based storage cluster recovery performance |
| US20130230058A1 (en) * | 2011-08-26 | 2013-09-05 | Texas Instruments Incorporated | Systems and methods for construction of and network coding using near-maximum distance separable (mds) linear network codes |
| CN103336785A (en) * | 2013-06-04 | 2013-10-02 | 华中科技大学 | Distributed storage method and distributed storage device based on network coding |
| CN103607304A (en) * | 2013-11-21 | 2014-02-26 | 中国人民解放军国防科学技术大学 | Erasure code based failure data linear restoration method |
| CN103944981A (en) * | 2014-04-14 | 2014-07-23 | 中国科学院计算技术研究所 | Cloud storage system and implement method based on erasure code technological improvement |
| CN105808170A (en) * | 2016-03-22 | 2016-07-27 | 华东交通大学 | RAID6 (Redundant Array of Independent Disks 6) encoding method capable of repairing single-disk error by minimum disk accessing |
| CN106100801A (en) * | 2016-08-29 | 2016-11-09 | 湖南大学 | A kind of non-homogeneous erasure code method of cloud storage system |
-
2016
- 2016-11-29 CN CN201611073014.1A patent/CN106788455B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100153822A1 (en) * | 2008-12-15 | 2010-06-17 | Microsoft Corporation | Constructing Forward Error Correction Codes |
| CN101834899A (en) * | 2010-04-29 | 2010-09-15 | 中科院成都信息技术有限公司 | Distributed adaptive coding and storing method |
| US20130230058A1 (en) * | 2011-08-26 | 2013-09-05 | Texas Instruments Incorporated | Systems and methods for construction of and network coding using near-maximum distance separable (mds) linear network codes |
| CN103209210A (en) * | 2013-03-04 | 2013-07-17 | 华中科技大学 | Method for improving erasure code based storage cluster recovery performance |
| CN103336785A (en) * | 2013-06-04 | 2013-10-02 | 华中科技大学 | Distributed storage method and distributed storage device based on network coding |
| CN103607304A (en) * | 2013-11-21 | 2014-02-26 | 中国人民解放军国防科学技术大学 | Erasure code based failure data linear restoration method |
| CN103944981A (en) * | 2014-04-14 | 2014-07-23 | 中国科学院计算技术研究所 | Cloud storage system and implement method based on erasure code technological improvement |
| CN105808170A (en) * | 2016-03-22 | 2016-07-27 | 华东交通大学 | RAID6 (Redundant Array of Independent Disks 6) encoding method capable of repairing single-disk error by minimum disk accessing |
| CN106100801A (en) * | 2016-08-29 | 2016-11-09 | 湖南大学 | A kind of non-homogeneous erasure code method of cloud storage system |
Non-Patent Citations (4)
| Title |
|---|
| 李晨卉: "应用于分布式存储系统的准循环再生码构造方案", 《计算机工程》 * |
| 杜芸芸: "一种面向纠删码技术的云存储可靠性机制", 《计算机应用与软件》 * |
| 王静 等: "云存储系统中基于MSR码的局部性修复编码", 《北京邮电大学学报》 * |
| 许方亮: "分布式存储系统中纠删码的数据修复技术研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109522150A (en) * | 2018-10-17 | 2019-03-26 | 长安大学 | Adaptive collapsible section duplication code construction and fault repairing method based on hypergraph |
| CN109522150B (en) * | 2018-10-17 | 2022-03-15 | 长安大学 | Hypergraph-based self-adaptive decomposable part repeated code construction and fault repair method |
| CN113315525A (en) * | 2021-06-03 | 2021-08-27 | 长安大学 | Construction of local repair code based on hypercube and method for repairing fault code element |
| CN113315525B (en) * | 2021-06-03 | 2024-02-27 | 深圳市正粤知识产权服务有限公司 | Construction of local repair code based on hypercube and fault code element repair method |
| CN113381772A (en) * | 2021-07-02 | 2021-09-10 | 广东工业大学 | Packet-based optimal local repair code construction method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106788455B (en) | 2019-11-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104021123B (en) | method and system for data migration | |
| CN103336785B (en) | A kind of distributed storage method based on network code and device thereof | |
| CN104052576B (en) | Data recovery method based on error correcting codes in cloud storage | |
| CN105260259B (en) | A kind of locality based on system minimum memory regeneration code repairs coding method | |
| CN107844272A (en) | A kind of cross-packet coding and decoding method for improving error correcting capability | |
| CN103746774B (en) | The fault-tolerant coding method that a kind of efficient data is read | |
| CN106484559A (en) | A kind of building method of check matrix and the building method of horizontal array correcting and eleting codes | |
| CN106788455B (en) | A kind of building method of the optimal partial repairable system code based on packet | |
| CN105956128B (en) | A kind of adaptive coding storage fault-tolerance approach based on simple regeneration code | |
| CN105808170B (en) | A kind of RAID6 coding methods that can repair single disk error | |
| CN111078460A (en) | Fast erasure code calculation method | |
| CN106815330A (en) | The generation method and system of the block chain expanded along Spatial Dimension | |
| CN105353974B (en) | A kind of two fault-tolerant coding methods for being applied to disk array and distributed memory system | |
| CN106776129A (en) | A kind of restorative procedure of the multinode data file based on minimum memory regeneration code | |
| CN108132854A (en) | A kind of correcting and eleting codes coding/decoding method that can restore data element and redundant elements simultaneously | |
| CN106788891A (en) | A kind of optimal partial suitable for distributed storage repairs code constructing method | |
| CN108762978B (en) | Grouping construction method of local part repeated cyclic code | |
| CN110389848A (en) | Part based on segmented construction repeats code constructing method and malfunctioning node restorative procedure | |
| CN110781024B (en) | Matrix construction method of symmetrical partial repetition code and fault node repairing method | |
| CN105933386B (en) | A kind of storage system construction method and device | |
| CN109521955B (en) | Heterogeneous part repeated code construction and conversion method based on hierarchical cross design | |
| CN106911793B (en) | I/O optimized distributed storage data repair method | |
| WO2018209541A1 (en) | Coding structure based on t-design fractional repetition codes, and coding method | |
| CN112732203B (en) | Regeneration code construction method, file reconstruction method and node repair method | |
| CN108628697A (en) | One kind being based on binary node restorative procedure and system |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CB03 | Change of inventor or designer information |
Inventor after: Li Xuepeng Inventor after: Mao Guoping Inventor after: Zheng Haochen Inventor after: Wang Zhihan Inventor after: Wang Yuebiao Inventor after: Li Ting Inventor after: Wu Xiangjun Inventor after: Zhang Xinyuan Inventor before: Li Xuepeng Inventor before: Mao Guoping Inventor before: Liu Xuan |
|
| CB03 | Change of inventor or designer information |