会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • SYSTEMATIC ENCODER WITH ARBITRARY PARITY POSITIONS
    • 具有仲裁特殊位置的系统编码器
    • US20110072334A1
    • 2011-03-24
    • US12635422
    • 2009-12-10
    • Joschi Tobias BRAUCHLERalf KOETTERNuala KOETTER
    • Joschi Tobias BRAUCHLERalf KOETTERNuala KOETTER
    • H03M13/15G06F11/10
    • H03M13/157H03M13/1515H03M13/6505H03M13/6538
    • An encoder structure for an error correcting code with arbitrary parity positions is presented. The invention is effective for all error correcting codes whose parity check matrix is of the Vandermonde type. In contrast to conventional encoder circuits, the parity symbols produced by this encoder are not restricted to form a block of consecutive parity symbols at the beginning or at the end of a codeword, but may be spread arbitrarily within the codeword. A general structure of the parity check matrix for such a code is found by exploiting the special Vandermonde structure of matrices. From this general parity check matrix, an expression for the evaluation of the parity symbols in terms of a polynomial with limited degree is derived. An efficient hardware implementation of the proposed encoder is suggested.
    • 提出了一种用于具有任意奇偶位置的纠错码的编码器结构。 本发明对于奇偶校验矩阵为Vandermonde类型的所有纠错码都是有效的。 与常规编码器电路相反,由该编码器产生的奇偶校验符号不限于在码字开始或结束处形成连续的奇偶校验符号块,而是可以在码字内任意扩展。 通过利用矩阵的特殊Vandermonde结构,可以发现这种代码的奇偶校验矩阵的一般结构。 根据该通用奇偶校验矩阵,导出用于以有限度的多项式来评估奇偶校验符号的表达式。 提出了提出的编码器的高效硬件实现。
    • 5. 发明申请
    • A Random linear coding approach to distributed data storage
    • 一种用于分布式数据存储的随机线性编码方法
    • US20060149753A1
    • 2006-07-06
    • US11026550
    • 2004-12-30
    • Muriel MedardSupratim DebRalf Koetter
    • Muriel MedardSupratim DebRalf Koetter
    • G06F17/30
    • H04L67/1095G06F17/30209H04L67/104
    • A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is detrmined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.
    • 提出了一种用于向分布式数据存储提供随机线性编码方法的方法和计算机程序产品。 文件被分成多个部分。 对于每个对等体(对等体意味着具有有限存储空间的存储位置),确定对等体可以存储的编码的数量。 每个编码器通过采用整个文件的所有片段的随机线性组合来确定。 为每个编码块存储关联码矢量。 通过收集来自对等体的代码矢量和编码块并以收集的码矢量作为矩阵来检索文件。 当矩阵的维数等于文件的数量时,使用矩阵中的代码向量的集合来恢复文件。
    • 7. 发明申请
    • RANDOM LINEAR CODING APPROACH TO DISTRIBUTED DATA STORAGE
    • 分布式数据存储的随机线性编码方法
    • US20120096124A1
    • 2012-04-19
    • US13267764
    • 2011-10-06
    • Muriel MedardSupratim DebRalf Koetter
    • Muriel MedardSupratim DebRalf Koetter
    • G06F15/16
    • H04L67/1095G06F17/30209H04L67/104
    • A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.
    • 提出了一种用于向分布式数据存储提供随机线性编码方法的方法和计算机程序产品。 文件被分成多个部分。 对于每个对等体(对等体意味着具有有限存储空间的存储位置),确定对等体可以存储的编码的数量。 每个编码片段通过采用整个文件的所有片段的随机线性组合来确定。 为每个编码块存储关联码矢量。 通过收集来自对等体的代码矢量和编码块并以收集的码矢量作为矩阵来检索文件。 当矩阵的维数等于文件的数量时,使用矩阵中的代码向量的集合来恢复文件。
    • 8. 发明授权
    • Random linear coding approach to distributed data storage
    • 随机线性编码方法分布式数据存储
    • US08046426B2
    • 2011-10-25
    • US11026550
    • 2004-12-30
    • Muriel MedardSupratim DebRalf Koetter
    • Muriel MedardSupratim DebRalf Koetter
    • G06F15/16
    • H04L67/1095G06F17/30209H04L67/104
    • A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.
    • 提出了一种用于向分布式数据存储提供随机线性编码方法的方法和计算机程序产品。 文件被分成多个部分。 对于每个对等体(对等体意味着具有有限存储空间的存储位置),确定对等体可以存储的编码的数量。 每个编码片段通过采用整个文件的所有片段的随机线性组合来确定。 为每个编码块存储关联码矢量。 通过收集来自对等体的代码矢量和编码块并以收集的码矢量作为矩阵来检索文件。 当矩阵的维数等于文件的数量时,使用矩阵中的代码向量的集合来恢复文件。