Liu et al., 2023 - Google Patents
Minimum storage partially cooperative regenerating codes with small sub-packetizationLiu et al., 2023
- Document ID
- 8555249348946502123
- Author
- Liu Y
- Wang Y
- Cai H
- Tang X
- Publication year
- Publication venue
- IEEE Transactions on communications
External Links
Snippet
The partially cooperative repair model is an available technology to deal with multiple node failures in a distributed storage system, which does not depend on the heavy assumption of exchanging data with all new nodes, increasing the flexibility of the system. In this paper …
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
- 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/1105—Decoding
- H03M13/1131—Scheduling of bit node or check node processing
- H03M13/1137—Partly parallel processing, i.e. sub-blocks or sub-groups of nodes being processed in parallel
-
- 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
-
- 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
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F11/1008—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices
- G06F11/1012—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices using codes or arrangements adapted for a specific type of error
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
- G06F15/163—Interprocessor communication
-
- 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
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Rawat et al. | Locality and availability in distributed storage | |
| Goparaju et al. | Minimum storage regenerating codes for all parameters | |
| Dau et al. | Repairing Reed-Solomon codes with multiple erasures | |
| Jin | Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes | |
| Papailiopoulos et al. | Repair optimal erasure codes through Hadamard designs | |
| Tamo et al. | The repair problem for Reed–Solomon codes: Optimal repair of single and multiple erasures with almost optimal node size | |
| CN104919476B (en) | The syndrome through quantum redundancy decoded state to degrade | |
| Gad et al. | Repair-optimal MDS array codes over GF (2) | |
| Guruswami et al. | Constructions of maximally recoverable local reconstruction codes via function fields | |
| Li et al. | On the sub-packetization size and the repair bandwidth of Reed-Solomon codes | |
| Hou et al. | A new design of binary MDS array codes with asymptotically weak-optimal repair | |
| Liu et al. | A new cooperative repair scheme with k+ 1 helper nodes for (n, k) Hadamard MSR codes with small sub-packetization | |
| Li et al. | On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound | |
| Zorgui et al. | Centralized multi-node repair for minimum storage regenerating codes | |
| Papailiopoulos et al. | Distributed storage codes through Hadamard designs | |
| Liu et al. | Minimum storage partially cooperative regenerating codes with small sub-packetization | |
| Khan et al. | Automatic synthesis of quaternary quantum circuits | |
| Su | Optimal pliable fractional repetition codes that are locally recoverable: A bipartite graph approach | |
| Wang et al. | Rack-aware MSR codes with error correction capability for multiple erasure tolerance | |
| Chee et al. | Low-power cooling codes with efficient encoding and decoding | |
| Huang et al. | Multi-erasure locally recoverable codes over small fields: A tensor product approach | |
| 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 | |
| Hao et al. | Constructions and weight distributions of optimal locally repairable codes | |
| Jiang et al. | Toward Lower Repair Bandwidth and Optimal Repair Complexity of Piggybacking Codes With Small Sub-Packetization |