摘要 |
<p>The present invention relates to a coding method for general projective self-repairing codes, comprising the following steps: acquiring a data block to be stored; setting a basic Galois field GF (q) with a size of q, with each of the data blocks being expressed by a vector with a length of m in the basic Galois field; obtaining a first Galois field GF (qi+1) and a second Galois field GF (qm), with GF(q)⊂GF(qi+1)⊂GF(qm); and constructing a coding vector Vi={wi-1, wi-1v, wi-1v2,...wi-1vt} of a storage node i, the coding vector of the storage node i being a group of base expanded by t- respectively, where i is a positive integer indicating the number of storage nodes, with i=1,2,...t; and obtaining the coding data of the data block stored in the storage node. The present invention also relates to a method for performing data reconstruction and data repair on a system which uses the above-mentioned coding method. Implementing the coding method for general projective self-repairing codes, and the data reconstruction and repair method of the present invention has the following beneficial effects: the data repairing thereof is very simple, and the amount of data downloaded is less.</p> |
申请人 |
PEKING UNIVERSITY SHENZHEN GRADUATE SCHOOL;SHENZHEN IPTV CO., LTD |
发明人 |
LI, HUI;ZHU, BING;HOU, HANXU;CHEN, CHANGMIN;ZHOU, JINGBANG;FAN, XIDONG |