This paper evaluates the performance of two seminal rateless erasure codes, LT Codes and Online Codes. Their properties make them appropriate for coping with communication channels having an unbounded loss rate. They are therefore very well suited to peer-to-peer systems. This evaluation targets two goals. First, it compares the performance of both codes in different adversarial environments an...

For a systematic erasure code, update complexity (UC) is defined as the maximum number of parity blocks needed to be changed when some information blocks are updated. Locally repairable codes (LRCs) have been recently proposed and used in real-world distributed storage systems. In this paper, update complexity of optimal LRCs is studied and both lower and upper bounds on UC are established in t...

Erasures, or errors with known locations, are a more favorable type of error for quantum error-correcting codes than Pauli errors. Converting physical noise into erasures can significantly improve the performance correction. Here we apply idea performing erasure conversion by encoding qubits metastable atomic states, proposed Wu, Kolkowitz, Puri, and Thompson [Nat. Comm. 13, 4657 (2022)], to tr...

Feedback is useful in memoryless channels for decreasing complexity and increasing reliability; the capacity of the memoryless channels, however, can not be increased by feedback. For fixed length block codes even the decay rate of error probability with block length does not increase with feedback for most channel models. Consequently for making the physical layer more reliable for higher laye...

This paper presents a new erasure code called Treeplication designed for distributed recovery of the full information word, while most prior work in coding storage only supports repair individual symbols. A $k$ symbols is defined on binary tree with $2k-1$ vertices, along distribution selecting from layers. We analyze and optimize under random-multiset model, which captures system property that...

The structure of LDPC-code over GF (16) is described. An iterative decoding algorithm based on adding and correcting of erasures is suggested. The numerical results of data transmission over the channel given by the dependencies of error and erasure probabilities on SNR are introduced (suggested decoding is used).

Erasure coding has been recognized as a powerful method to mitigate delays due slow or straggling nodes in distributed systems. This work shows that erasure of data objects can flexibly handle skews the request rates. Coding help boost service rate region , is, increase overall volume access re...

A new method for low-complexity near-maximum-likelihood (ML) decoding of low-density parity-check (LDPC) codes over the additive white Gaussian noise channel is presented. The proposed method termed beliefpropagation–list erasure decoding (BP-LED) is based on erasing carefully chosen unreliable bits performed in case of BP decoding failure. A strategy of introducing erasures into the received v...

Frank Uyeda, Huaxia Xia, Andrew A. Chien Computer Science and Engineering Department University of California, San Diego {fuyeda, hxia, achien}@ucsd.edu September 9, 2004 Abstract We examine the properties and performance of LT Codes for use in a high performance distributed file system. Different variations to the algorithm were created to achieve key characteristics, such as speed and data re...

Erasure codes are an integral part of many distributed storage systems aimed at Big Data, since they provide high fault-tolerance for low overheads. However, traditional erasure codes are inefficient on reading stored data in degraded environments (when nodes might be unavailable), and on replenishing lost data (vital for long term resilience). Consequently, novel codes optimized to cope with d...