摘要 |
<p>Provided is a method for constructing a distributed storage code capable of accurate regeneration, which comprises the steps of: constructing an information matrix M with a certain size from a file to be stored, each item of data in the file being a certain element in the information matrix; setting a coding matrix Psi, the coding matrix Psi comprising n rows of vectors, and n being the number of distributed storage nodes used for storage; multiplying the information matrix M and the coding matrix Psi to obtain a codeword matrix C, the codeword matrix also comprising n rows of vectors; and respectively storing the n rows of vectors of the codeword matrix C in n storage nodes, all the elements in all the matrixes belonging to a finite domain Fq of which the size is q. In addition, also provided is a device for achieving the abovementioned method. The method and device for constructing a distributed storage code capable of accurate regeneration have the following beneficial effects: the realization thereof is easier, and the required finite domain is smaller.</p> |
申请人 |
PEKING UNIVERSITY SHENZHEN GRADUATE SCHOOL;LI, HUI;HOU, HANXU;MIU, WEIHAO;LI, SHUOYAN;ZHU, BING;GUO, HAN |
发明人 |
LI, HUI;HOU, HANXU;MIU, WEIHAO;LI, SHUOYAN;ZHU, BING;GUO, HAN |