专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2017194780A1 BALANCED LOCALLY REPAIRABLE ERASURE CODES 审中-公开
标题翻译：平衡的本地可修复擦除代码
公开(公告)号：WO2017194780A1
公开(公告)日：2017-11-16
申请号：PCT/EP2017/061538
申请日：2017-05-12
申请人： NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY , MEMOSCALE AS
发明人： GLIGOROSKI, Danilo , KRALEVSKA, Katina
IPC分类号： H03M13/13 , H03M13/03 , H03M13/37 , G06F11/10
CPC分类号： H03M13/036 , H03M13/134 , H03M13/373 , H03M13/3761 , H03M13/616
摘要： Disclosed herein is a method of determining a generator matrix for defining a systematic code with parameters [n, k, d] over GF(q), wherein n is the total number of nodes, k is the number of source nodes, (n - k) is the number of redundant nodes, d is the minimum distance of the code and q is size of the finite field, the method comprising determining the generator matrix to have the form: G = [ I k \ P] where I k is an identity matrix of order k; and P is a kx (n - k) matrix; determining the values in P in accordance with the condition that the Hamming weight of every row in P is equal to w, where w w and l is the locality of redundant nodes generated by the code; and determining the values in P in accordance with the condition that for every submatrix P' of P consisting of v rows from P, where 1 ≤ v ≤ w, Rank(P') = v.
摘要翻译：这里公开了一种确定生成矩阵的方法，该生成矩阵用于定义GF（q）上的具有参数[n，k，d]的系统码，其中n是节点的总数，k是（n-k）是冗余节点的数量，d是代码的最小距离，并且q是有限域的大小，该方法包括确定生成矩阵具有以下形式：G = [I 其中I k是k阶单位矩阵; P是kx（n - k）矩阵; 根据P中每一行的汉明权重等于w的条件确定P中的值，其中w < k，根据每列的汉明权重至少为l的条件确定P中的值，其中l> w和l是由代码生成的冗余节点的局部性; 并根据以下条件确定P中的值：对于由P构成的v个行的每个子矩阵P'，其中1≤v≤w，Rank（P'）= v。

2. 发明申请

WO2016180727A1 SYSTEMATIC CODING TECHNIQUE FOR DISTRUBTED STORAGE SYSTEMS 审中-公开
标题翻译：分布式存储系统的系统编码技术
公开(公告)号：WO2016180727A1
公开(公告)日：2016-11-17
申请号：PCT/EP2016/060180
申请日：2016-05-06
申请人： NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY
发明人： JENSEN, Rune Erlend , KRALEVSKA, Katina , GLIGOROSKI, Danilo , STENE, Sindre Berg
IPC分类号： H03M13/37 , G06F11/10 , H03M13/15
CPC分类号： H03M13/373 , H03M13/1515 , H03M13/3761
摘要： Disclosed herein is a method of generating a generator matrix for defining how to systematically code source data, the method comprising: determining source nodes for comprising a plurality of sub-stripes of source data, wherein the number of source nodes is K and the number of sub-stripes of source data comprised by each source node is S; determining redundant nodes for comprising a plurality of sub-stripes of coded data, wherein the number of redundant nodes is R and the number of sub-stripes of coded data comprised by each redundant node is S; determining values of a first generator matrix according to a systematic coding technique such that K of the rows of the generator matrix to define how to generate all of the K source nodes as comprising source data and R of the rows of the first generator matrix define how to generate all of the R redundant nodes as comprising combinations of two or more of the source nodes; generating a second generator matrix, with a first dimension (KxS) and a second dimension ((K+R)xS), in dependence on the determined first generator matrix, wherein each value of the second generator matrix defines how to generate the data comprised by a respective sub-stripe of a node defined by the first generator matrix such that the values of the second generator matrix define how to generate all of the sub-stripes of all of the nodes defined by the first generator matrix; and changing one or more of the values of the second generator matrix so that a sub-stripe of at least one of the redundant nodes is defined, by the systematic coding technique, as being dependent on a combination of two or more sub-stripes of data in the source nodes and is further defined as being dependent on one or more further sub-stripes of data, in a respective one or more source nodes, that the sub-stripe of the redundant node was not defined as being dependent on by the systematic coding technique. Advantageously, when the second generator matrix is used to generate erasure coded data in a data storage system, the amount of data that needs to be obtained to reconstruct a lost data node is less than if Reed-Solomon or other known coding techniques had been used.
摘要翻译：本文公开了一种生成用于定义如何对源数据进行系统地编码的生成矩阵的方法，所述方法包括：确定源节点以包括源数据的多个子条，其中源节点数为K，数目为由每个源节点包含的源数据的子条带是S; 确定用于包括编码数据的多个子条的冗余节点，其中所述冗余节点的数量为R，并且由每个冗余节点包括的编码数据的子条数为S; 根据系统编码技术确定第一生成矩阵的值，使得生成矩阵的行的K定义如何生成包括源数据的所有K个源节点以及第一生成矩阵的行的R定义如何以产生包括两个或多个源节点的组合的所有R个冗余节点; 根据所确定的第一生成矩阵生成具有第一维度（KxS）和第二维度（（K + R）xS）的第二生成矩阵，其中第二生成矩阵的每个值定义如何生成包括的数据通过由第一生成矩阵定义的节点的相应子条，使得第二生成矩阵的值定义如何生成由第一生成矩阵定义的所有节点的所有子条; 以及改变所述第二发生器矩阵的一个或多个值，使得所述冗余节点中的至少一个的子条带通过所述系统编码技术被定义为依赖于两个或更多个子条带的组合在源节点中的数据被进一步定义为依赖于相应的一个或多个源节点中的一个或多个另外的数据子条，所述冗余节点的子条带未被定义为依赖于系统编码技术。有利地，当第二生成矩阵用于在数据存储系统中生成擦除编码数据时，需要获得的用于重构丢失数据节点的数据量小于如果使用了里德 - 所罗门或其他已知的编码技术。

3. 发明申请

WO2017109220A1 SYSTEMATIC CODING TECHNIQUE FOR ERASURE CORRECTION 审中-公开
标题翻译：系统编码擦除技术
公开(公告)号：WO2017109220A1
公开(公告)日：2017-06-29
申请号：PCT/EP2016/082656
申请日：2016-12-23
申请人： NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY
发明人： GLIGOROSKI, Danilo , KRALEVSKA, Katina
IPC分类号： H03M13/03 , H03M13/13 , H03M13/37 , G06F11/10
CPC分类号： H03M13/036 , H03M13/13 , H03M13/3761
摘要： Disclosed herein is a method for determining how to encode data in accordance with a systematic coding technique and encoding data in accordance with the determined systematic coding technique, the method comprising: determining the code parameters n, k, r and α, wherein n is the total number of nodes, k is the total number of source data nodes, r is the total number of redundant nodes, such that n = k + r, α is the number of substripes of data in one of the nodes and each of the source data nodes and redundant nodes comprise the same number of substripes, and wherein α is determined so that it satisfies either the condition m or both of the conditions α = r m and (k/r) is not an integer, where m = ceiling(k/r); determining source data nodes that comprise source data that is not encoded by the systematic coding technique; for each of the redundant nodes, determining to generate each of the substripes of data in dependence on a combination of a different substripe from each of the source data nodes such that each of the substripes is generated in dependence on a combination of k substripes of source data and the α substripes of the redundant node are generated in dependence on all of the (α x k) substripes of source data; and determining each of one or more of the substripes of at least one of the redundant nodes to be further dependent on at least one further substripe of source data that it is not currently dependent on, wherein said determination comprises selecting a further substripe of source data for a redundant node to be further dependent on with the further substripe being selectable from any one of the k source nodes; and encoding data in accordance with the determined systematic coding technique. Embodiments of the invention provide a systematic coding technique with one or more of the advantageous properties of being Maximum-Distance Separable, systematic, having a flexible sub- packetisation level, providing minimum repair bandwidth, access optimality and fast decoding.
摘要翻译：本文公开了一种用于确定如何根据系统编码技术对数据进行编码并且根据所确定的系统编码技术对数据进行编码的方法，所述方法包括：确定码参数n，k， r和α，其中n是节点的总数，k是源数据节点的总数，r是冗余节点的总数，使得n = k + r，α是在一个数据中的子条纹的数量节点中的每一个以及源数据节点和冗余节点中的每一个包括相同数量的子条纹，并且其中确定α以便满足条件＆lt; α＆lt; 或者条件α= rm和（k / r）两者不是整数，其中m = ceiling（k / r）; 确定包括未被所述系统编码技术编码的源数据的源数据节点; 对于每个冗余节点，确定根据来自每个源数据节点的不同子条纹的组合来生成数据的每个子条纹，从而根据源的k个子条纹的组合来生成每个子条纹根据源数据的所有（αxk）子条纹生成冗余节点的数据和α子条纹; 以及确定所述冗余节点中的至少一个冗余节点的一个或多个子条纹中的每一个进一步依赖于它当前不依赖于的源数据的至少一个另外的子条纹，其中所述确定包括选择源数据的另一子条纹以使冗余节点进一步依赖于可从k个源节点中的任何一个中选择的另一子条; 以及根据所确定的系统编码技术对数据进行编码。本发明的实施例提供了系统编码技术，其具有一个或多个有利特性，即最大距离可分离，系统化，具有灵活的子分组级别，提供最小修复带宽，接入最优性和快速解码。

4. 发明申请

WO2015197413A1 CODING IN GALOIS FIELDS WITH REDUCED COMPLEXITY 审中-公开
标题翻译：在减少复杂度的GALOIS领域进行编码
公开(公告)号：WO2015197413A1
公开(公告)日：2015-12-30
申请号：PCT/EP2015/063337
申请日：2015-06-15
申请人： NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY
发明人： GLIGOROSKI, Danilo , KRALEVSKA, Katina
IPC分类号： H03M13/35 , H03M13/37 , H03M13/00
CPC分类号： H04L69/324 , H03M7/00 , H03M13/353 , H03M13/373 , H03M13/616 , H04L1/0009 , H04L1/0076 , H04L69/22
摘要： Disclosed herein is a method of generating a coded data packet in dependence on a plurality of source data packets, the method comprising: determining a plurality of data packets, for generating a coded data packet, from a plurality of source data packets for encoding, wherein each of the plurality of source data packets for encoding comprises the same number of bits; generating a multiplied data packet in dependence on one or more multiplication operations between a multiplication value and bits of one of the determined data packets; and generating a coded data packet in dependence on a combination of the multiplied data packet and one or more of the other of said plurality of determined data packets that have not been multiplied; wherein the one or more multiplication operations are performed as operations in the finite field GF (p); p is greater than 2; the multiplication value is an element of the finite field GF (p); the multiplication value is not 0 or 1; and the combination of data packets is performed by bitwise XOR operations. Advantageously, the coding scheme can be almost as computationally efficient as GF (2) and the likelihood of obtained coded data packets being linearly independent is greatly increased.
摘要翻译：本文公开了一种根据多个源数据分组生成编码数据分组的方法，所述方法包括：从多个用于编码的源数据分组中确定用于生成编码数据分组的多个数据分组，其中用于编码的多个源数据分组中的每一个包括相同数量的比特; 根据乘法值与所确定的数据分组之一的比特之间的一个或多个乘法运算产生相乘的数据分组; 以及根据所述相乘的数据分组与所述多个确定的数据分组中的另一个中未被乘法的一个或多个的组合，生成编码数据分组; 其中所述一个或多个乘法运算作为有限域GF（p）中的操作执行; p大于2; 乘法值是有限域GF（p）的元素; 乘法值不为0或1; 并且通过按位XOR操作来执行数据分组的组合。有利地，编码方案可以几乎与GF（2）计算有效，并且所获得的编码数据分组的线性独立性的可能性大大增加。

5. 发明申请

WO2018029212A1 REGENERATING LOCALLY REPAIRABLE CODES FOR DISTRIBUTED STORAGE SYSTEMS 审中-公开
标题翻译：为分布式存储系统重新设计本地可修复的代码
公开(公告)号：WO2018029212A1
公开(公告)日：2018-02-15
申请号：PCT/EP2017/070110
申请日：2017-08-08
申请人： MEMOSCALE AS
发明人： SIMONSEN, Per , GLIGOROSKI, Danilo , JENSEN, Rune Erlend , KRALEVSKA, Katina
IPC分类号： H03M13/37 , H03M13/13 , H03M13/03 , G06F11/10
摘要： Disclosed herein is a method for generating local and global parity nodes for source nodes, the method comprising: generating a first set of parity nodes for source nodes by applying a systematic encoding technique to the source nodes, wherein the first set of parity nodes comprises a plurality of parity nodes and each of the parity nodes in the first set of parity nodes is a global parity node; generating, in dependence on at least one of the parity nodes in the first set, a plurality of local parity nodes; generating a second set of parity nodes for the source nodes, wherein the second set of parity nodes comprises said plurality of local parity nodes and all of the parity nodes in the first set except for said at least one of the parity nodes in the first set that the plurality of local parity nodes were generated in dependence on; and using the second set of parity nodes as the parity nodes of the source data. Advantageously, embodiments combine the beneficial aspects of exact regenerating systematic codes and locally repairable codes.
摘要翻译：本文公开了一种用于为源节点生成本地和全局奇偶校验节点的方法，所述方法包括：通过将系统编码技术应用于源节点来生成用于源节点的第一奇偶校验节点集合，其中，所述第一组奇偶校验节点包括多个奇偶校验节点，并且所述第一组奇偶校验节点中的每一个奇偶校验节点是全局奇偶校验节点; 根据第一组中的至少一个奇偶校验节点生成多个本地校验节点; 生成用于源节点的第二奇偶校验节点集合，其中第二奇偶校验节点集合包括所述多个本地奇偶校验节点以及除了第一集合中的所述至少一个奇偶校验节点之外的第一集合中的所有奇偶校验节点多个本地奇偶校验节点是依赖于生成的; 以及使用第二组奇偶校验节点作为源数据的奇偶校验节点。有利地，实施例结合了精确再生系统代码和本地可修复代码的有益方面。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式