[go: up one dir, main page]

Wu, 2011 - Google Patents

A construction of systematic MDS codes with minimum repair bandwidth

Wu, 2011

View PDF
Document ID
13734741624013058049
Author
Wu Y
Publication year
Publication venue
IEEE Transactions on Information Theory

External Links

Snippet

In a distributed storage system based on erasure coding, an important problem is the repair problem: If a node storing a coded piece fails, in order to maintain the same level of reliability, we need to create a new encoded piece and store it at a new node. This paper …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
    • G06F11/08Error detection or correction by redundancy in data representation, e.g. by using checking codes
    • G06F11/10Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • HELECTRICITY
    • H03BASIC ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error 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/11Error 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/1102Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30Information retrieval; Database structures therefor; File system structures therefor
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • HELECTRICITY
    • H03BASIC ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/41Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
    • HELECTRICITY
    • H03BASIC ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/29Coding, 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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2906Coding, 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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using block codes
    • H03M13/2909Product codes

Similar Documents

Publication Publication Date Title
Wu A construction of systematic MDS codes with minimum repair bandwidth
US11531593B2 (en) Data encoding, decoding and recovering method for a distributed storage system
Hou et al. Rack-aware regenerating codes for data centers
US9141679B2 (en) Cloud data storage using redundant encoding
Wu Existence and construction of capacity-achieving network codes for distributed storage
US9722637B2 (en) Construction of MBR (minimum bandwidth regenerating) codes and a method to repair the storage nodes
Papailiopoulos et al. Locally repairable codes
US9647698B2 (en) Method for encoding MSR (minimum-storage regenerating) codes and repairing storage nodes
Zhu et al. General fractional repetition codes for distributed storage systems
KR20120058556A (en) Methods and apparatus employing fec codes with permanent inactivation of symbols for encoding and decoding processes
Olmez et al. Repairable replication-based storage systems using resolvable designs
Shahabinejad et al. A class of binary locally repairable codes
Silberstein et al. Locality and availability of array codes constructed from subspaces
CN103703446B (en) Data reconstruction that network storage Zhong Kang Byzantium lost efficacy, failure-data recovery method and device
Hollmann Storage codes—Coding rate and repair locality
Dau et al. Repairing Reed-Solomon codes via subspace polynomials
Obata Optimal lower bounds for 2-query locally decodable linear codes
WO2018073850A1 (en) Design of puncturing pattern for polar codes
CN104782101B (en) Encoding, reconstruction and recovery methods for self-healing codes for distributed network storage
Wu et al. Soft-decision decoding of linear block codes using preprocessing and diversification
Dimakis et al. A survey on network codes for distributed storage
Gholami et al. On multi-message private computation
Chen et al. A new Zigzag MDS code with optimal encoding and efficient decoding
US9489252B1 (en) File recovery using diverse erasure encoded fragments
Gabrys et al. Reconciling similar sets of data