发明名称 METHOD FOR ENCODING MSR (MINIMUM-STORAGE REGENERATING) CODES AND REPAIRING STORAGE NODES
摘要 The invention relates to a method for encoding MSR (Minimum-storage Regenerating) codes, which comprises the following steps of: acquiring n first data packets which are represented by Si, i=1, 2, . . . , n; setting n storage nodes and a positive integer k, wherein n=2K; respectively adding a specified number of 0 bits on data heads or data tails of subsequent successive k first data packets by taking the next first data packet of the ith first data packet as a starting point, acquiring k second data packets, and acquiring an encoded data packet by computing the k second data packets; repeating the above steps and acquiring n encoded data packets which are represented by Pi, i=1, 2, . . . , n; and storing the ith first data packet and the encoded data packet acquired by taking the next first data packet of the first data packet as the starting point into the ith storage node.
申请公布号 US2015358037(A1) 申请公布日期 2015.12.10
申请号 US201313978315 申请日期 2013.02.26
申请人 LI Hui;PEKING UNIVERSITY SHENZHEN GRADUATE SCHOOL 发明人 LI Hui;HOU Hanxu;ZHU Bing
分类号 H03M13/00;G06F11/10 主分类号 H03M13/00
代理机构 代理人
主权项 1. A method for encoding MSR (Minimum-storage Regenerating) codes, comprising the following steps of: A) dividing raw data into n data blocks and acquiring n first data packets, in which the first data packets represented by Si, i=1, 2, . . . , n, and n being an even integer; B) setting n storage nodes and a positive integer k, in which n=2k; C) taking the next first data packet of the ith first data packet as a starting point, respectively adding a specified number of 0 bits on data heads or data tails of the starting point and subsequent successive k−1 first data packets, acquiring k second data packets, and acquiring an encoded data packet by computing the k second data packets; and repeating the above steps and acquiring n encoded data packets represented by Pi, i=1, 2, . . . , n, in which the nth first data packet and the 1st first data packet being successive, namely the next successive first data packet being the 1st first data packet when one among the successive k first data packets being the nth first data packet; and D) storing the ith first data packet and the encoded data packet acquired by taking the next first data packet of the first data packet as the starting point into the ith storage node.
地址 US
您可能感兴趣的专利