首页> 外国专利> CODING METHOD FOR GENERAL PROJECTIVE SELF-REPAIRING CODES, AND DATA RECONSTRUCTION AND REPAIR METHOD

CODING METHOD FOR GENERAL PROJECTIVE SELF-REPAIRING CODES, AND DATA RECONSTRUCTION AND REPAIR METHOD

机译:通用投射自修复码的编码方法,数据重建与修复方法

摘要

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.
机译:本发明涉及一种用于一般投影自修复码的编码方法,包括以下步骤:获取要存储的数据块;设置大小为q的基本伽罗瓦域GF(q),其中每个数据块由基本伽罗瓦域中长度为m的向量表示;获得第一个Galois场GF(q i + 1 )和第二个Galois场GF(q m ),其中GF(q)⊂GF(q i +1 )⊂GF(q m );并构建编码向量V i = {w i-1 ,w i-1 v,w i-1 v 2 ,... w i-1 v t },存储节点i的编码向量是分别扩展了t-的一组基,其中i是指示存储节点数的正整数,其中i = 1,2,... t;获取存储在存储节点中的数据块的编码数据。本发明还涉及一种在使用上述编码方法的系统上执行数据重建和数据修复的方法。实现通用的投影式自修复码的编码方法,以及本发明的数据重建和修复方法具有以下有益效果:其数据修复非常简单,下载的数据量较少。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号