Alisrruct-Linear block codes are studied for improving the reliability of message storage in computer memory with stuck-at defects and noise. The case when the side information about the state of the defects is available to the decoder or to the encoder is considered. In the former case, stuck-at cells act as erasures so that techniques for decoding linear block codes for erasures and errors ca...

This thesis explores the problems of lossy source coding and information embedding. For lossy source coding, we analyze low density parity check (LDPC) codes and low density generator matrix (LDGM) codes for quantization under a Hamming distortion. We prove that LDPC codes can achieve the rate-distortion function. We also show that the variable node degree of any LDGM code must become unbounded...

Distributed storage systems introduce redundancy to increase reliability. When erasure coding is used, the exact repair problem arises: if a node storing encoded information fails, in order to maintain the same level of reliability we need to create encoded information at a new node. This amounts to a partial recovery of the code, whereas conventional erasure coding focuses on the complete reco...

In this paper, we propose an effective error and erasure decoding scheme with multilevel erasure-decision threshold for Reed-Solomon (RS) codes in frequency-hopped multiple-access communications with M-ary FSK signaling, and analyze its performance.RS coding is used to correct erasures and errors caused by other-user interference and thermal noise. The proposed decoder decides whether to erase ...

The quality of online multimedia is required higher and higher, yet the uncertainty of network, such as interference, connection failure, still exists. In order to ensure the quality of service in multimedia transmission, we incorporate erasure code with video code together, and present a collaborative coding framework of Reed-Solomon code (RS) and H.264. First of all, we analyze the common cod...

We perform a quantitative analysis of the costs and benefits of using file systems whose long term reliability methods are based on erasure codes. We compare it with replication a special case of erasure codes that is used in many reliable file systems. Our main goal in benefit analysis is to see how much of an increase in the expected system lifetime can be achieved with erasure codes or the s...

Decoding performance of Fountain codes for the binary erasure channel (BEC) depends on two aspects. One is the essential code structure, on which stopping set analysis operates. The other is the effect from the channel characteristic, which is difficult to give a precise estimation. To tackle these problems, in this paper, we propose a solution to analyzing the performance of Fountain codes bas...

RC (Random/Clustered) codes are a new efficient array-code family for recovering from 4-erasures. RC codes correct most 4-erasures, and essentially all 4-erasures that are clustered. Clustered erasures are introduced as a new erasure model for storage arrays. This model draws its motivation from correlated device failures, that are caused by physical proximity of devices, or by age proximity of...

Data centers store a massive amount of data in a large number of servers built by commodity hardware. To maintain data integrity against server failures, erasure codes have been extensively deployed in modern data centers to provide a higher level of failure tolerance with less storage overhead than replication. Yet, compared to replication, disseminating erasure-coded data from a source server...