Jin et al., 2017 - Google Patents
Repairing algebraic geometry codesJin et al., 2017
- Document ID
- 16721611753115032997
- Author
- Jin L
- Luo Y
- Xing C
- Publication year
- Publication venue
- IEEE Transactions on Information Theory
External Links
Snippet
Minimum storage regenerating codes have minimum storage of data in each node and therefore are maximal distance separable (for short) codes. Thus, the number of nodes is upper-bounded by 2 b, where ú is the bits of data stored in each node. From both theoretical …
- 230000001172 regenerating 0 abstract description 28
Classifications
-
- 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
-
- 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
-
- 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/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0894—Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
-
- 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/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/80—Wireless
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Papailiopoulos et al. | Locally repairable codes | |
| Tamo et al. | Bounds on the parameters of locally recoverable codes | |
| Tamo et al. | The repair problem for Reed–Solomon codes: Optimal repair of single and multiple erasures with almost optimal node size | |
| Wang et al. | Repair locality with multiple erasure tolerance | |
| Papailiopoulos et al. | Repair optimal erasure codes through Hadamard designs | |
| Gad et al. | Repair-optimal MDS array codes over GF (2) | |
| Hou et al. | BASIC regenerating code: Binary addition and shift for exact repair | |
| Guruswami et al. | Constructions of maximally recoverable local reconstruction codes via function fields | |
| Jin et al. | Repairing algebraic geometry codes | |
| Hou et al. | A new design of binary MDS array codes with asymptotically weak-optimal repair | |
| Jin et al. | Algebraic geometry codes with complementary duals exceed the asymptotic Gilbert-Varshamov bound | |
| Vardy et al. | Constructions of batch codes with near-optimal redundancy | |
| Hou et al. | New MDS array code correcting multiple disk failures | |
| Su | Optimal pliable fractional repetition codes that are locally recoverable: A bipartite graph approach | |
| Wang et al. | Bounds and constructions for linear locally repairable codes over binary fields | |
| Yu et al. | Harmonic coding: An optimal linear code for privacy-preserving gradient-type computation | |
| Liu et al. | A generic transformation to generate MDS array codes with δ-optimal access property | |
| Ding et al. | Communication efficient secret sharing with small share size | |
| Song et al. | A new multi‐use multi‐secret sharing scheme based on the duals of minimal linear codes | |
| Wang et al. | Low-access repair of Reed-Solomon codes in rack-aware storage | |
| Zhu et al. | Exploring node repair locality in fractional repetition codes | |
| Li et al. | MDS array codes with (near) optimal repair bandwidth for all admissible repair degrees | |
| Kong | Locally repairable convertible codes with optimal access costs | |
| CN102185897B (en) | Safe distributed virtual storage pool system | |
| Fang et al. | Singleton-optimal LRCs and perfect LRCs via cyclic codes |