-
公开(公告)号：US09866349B2
公开(公告)日：2018-01-09
申请号：US14902251
申请日：2014-06-24
Inventor： Danilo Gligoroski , Katina Kralevska
CPC classification number: H04L1/0041 , G06F17/16 , G06F17/18 , H03M13/3761 , H04L1/0076 , H04L63/04 , H04L69/22 , H04L2001/0097
Abstract: Disclosed herein is a method of generating an encoded data packet over GF(2). The method comprises determining 303 a plurality of data packets in dependence on a Latin rectangle, wherein the plurality of data packets have equal length; and generating 305 an encoded data packet by bitwise XORing the determined plurality of data packets. The efficiency of encoding, decoding, and transmission over a network of data packets are all improved, as well as the security properties of the transmitted information.
-
公开(公告)号：US20170142238A1
公开(公告)日：2017-05-18
申请号：US15319428
申请日：2015-06-15
Inventor： Danilo Gligoroski , Katina Kralevska
CPC classification number: H04L69/324 , H03M7/00 , H03M13/353 , H03M13/373 , H03M13/616 , H04L1/0009 , H04L1/0076 , H04L69/22
Abstract: 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.
-
公开(公告)号：US20160373210A1
公开(公告)日：2016-12-22
申请号：US14902251
申请日：2014-06-24
Inventor： Danilo Gligoroski , Katina Kralevska
CPC classification number: H04L1/0041 , G06F17/16 , G06F17/18 , H03M13/3761 , H04L1/0076 , H04L63/04 , H04L69/22 , H04L2001/0097
Abstract: Disclosed herein is a method of generating an encoded data packet over GF(2). The method comprises determining 303 a plurality of data packets in dependence on a Latin rectangle, wherein the plurality of data packets have equal length; and generating 305 an encoded data packet by bitwise XORing the determined plurality of data packets. The efficiency of encoding, decoding, and transmission over a network of data packets are all improved, as well as the security properties of the transmitted information.
Abstract translation: 本文公开了一种在GF（2）上生成编码数据分组的方法。 该方法包括：根据拉丁方框确定303多个数据分组，其中多个数据分组具有相等的长度; 以及通过对确定的多个数据分组进行按位异或来产生编码数据分组305。 通过数据包网络进行编码，解码和传输的效率都得到了改进，同时也提高了传输信息的安全性。
-
公开(公告)号：US09430443B1
公开(公告)日：2016-08-30
申请号：US14707211
申请日：2015-05-08
Inventor： Rune Erlend Jensen , Katina Kralevska , Danilo Gligoroski , Sindre Berg Stene
CPC classification number: H03M13/1174 , H03M13/033 , H03M13/134 , H03M13/373 , H03M13/6502
Abstract: 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 (K×S) and a second dimension ((K+R)×S), 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.
-
-
-
Search Results
4
records
(took 0.013 seconds)
