+

Papailiopoulos et al., 2013 - Google Patents

Repair optimal erasure codes through Hadamard designs

Papailiopoulos et al., 2013

View PDF
Document ID
11095964019149312158
Author
Papailiopoulos D
Dimakis A
Cadambe V
Publication year
Publication venue
IEEE Transactions on Information Theory

External Links

Snippet

<? Pub Dtl=""?> In distributed storage systems that employ erasure coding, the issue of minimizing the total communication required to exactly rebuild a storage node after a failure arises. This repair bandwidth depends on the structure of the storage code and the repair …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148—Structural properties of the code parity-check or generator matrix
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials

Similar Documents

Publication Publication Date Title
Papailiopoulos et al. Repair optimal erasure codes through Hadamard designs
Hao et al. Bounds and constructions of locally repairable codes: parity-check matrix approach
Papailiopoulos et al. Locally repairable codes
Rawat et al. Locality and availability in distributed storage
Kumar et al. Achieving maximum distance separable private information retrieval capacity with linear codes
Shanmugam et al. A repair framework for scalar MDS codes
Goparaju et al. Binary cyclic codes that are locally repairable
Shah et al. Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff
Song et al. Optimal locally repairable linear codes
CN102624866B (en) Data storage method, data storage device and distributed network storage system
Koyluoglu et al. Secure cooperative regenerating codes for distributed storage systems
Silberstein et al. Locality and availability of array codes constructed from subspaces
Freij-Hollanti et al. $ T $-private information retrieval schemes using transitive codes
Shahabinejad et al. A class of binary locally repairable codes
Lin et al. A unified form of exact-MSR codes via product-matrix frameworks
Maturana et al. Bandwidth cost of code conversions in distributed storage: Fundamental limits and optimal constructions
Tang et al. A new repair strategy for the Hadamard minimum storage regenerating codes for distributed storage systems
Su Optimal pliable fractional repetition codes that are locally recoverable: A bipartite graph approach
Dau et al. Repairing Reed-Solomon codes via subspace polynomials
Huang et al. Set message-passing decoding algorithms for regular non-binary LDPC codes
Hao et al. On the linear codes with (r, δ)-locality for distributed storage
Dimakis et al. A survey on network codes for distributed storage
Kadhe et al. On an equivalence between single-server PIR with side information and locally recoverable codes
Li et al. MDS array codes with (near) optimal repair bandwidth for all admissible repair degrees
Jin et al. Repairing algebraic geometry codes
点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载