Results 281 to 290 of about 4,215 (309)
Some of the next articles are maybe not open access.
Application of DFT codes for robustness to erasures
GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2002Discrete Fourier transform (DFT) codes are used to provide robustness against packet losses in IP networks. First, the relationship between DFT codes and over-complete expansions using frames is established. It is shown that the message recovery by syndrome decoding of erasures and direct signal space projection from received samples are equivalent ...
Gagan Rath +2 more
openaire +1 more source
On multicasting with streaming burst-erasure codes
2009 IEEE International Symposium on Information Theory, 2009We study a multicast extension of streaming burst-erasure codes previously proposed for the single user setting. There are two receivers each interested in the common stream. Each receiver's channel however has a different burst parameter and likewise each receiver tolerates a different delay; both receivers are interested in a common stream.
Jatinder P. Singh, Ashish Khisti
openaire +1 more source
Verifying distributed erasure-coded data
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, 2007Erasure coding can reduce the space and band width overheads of redundancy in fault-tolerant data storage and delivery systems. But it introduces the fundamental difficulty of ensuring that all erasure-coded fragments correspond to the same block of data. Without such assurance, a different block may be reconstructed from different subsets of fragments.
James Hendricks +2 more
openaire +1 more source
Update-efficient codes for erasure correction
2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2010The problem of designing codes to protect against server failures in a distributed storage system for frequently changing data is considered. When the original data changes, the coded packets stored on the servers must be updated accordingly. Since performing updates consumes costly bandwidth and energy, it is of interest to construct codes that have ...
N. Prasanth Anthapadmanabhan +2 more
openaire +1 more source
Binary Erasure Codes for Packet Transmission Subject to Correlated Erasures
2006We design some simple binary codes that are very well suited to reconstruct erased packets over a transmission medium that is characterized by correlation between subsequent erasures. We demonstrate the effectiveness of these codes for the transmission of video packets for HDTV over a DSL connection.
Frederik Vanhaverbeke +3 more
openaire +1 more source
HoVer Erasure Codes For Disk Arrays
International Conference on Dependable Systems and Networks (DSN'06), 2006We present a new family of XOR-based erasure codes primarily targeted for use in disk arrays. These codes have a unique data/parity layout, with both horizontal and vertical parity arrangements giving rise to the name HoVer codes. We give constructions that tolerate up to four disk failures.
openaire +1 more source
Erasure Coding in Object Stores
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018Recent years have seen a tremendous growth in the popularity of online services accessed over the Internet. Our daily lives are becoming more and more dependent on these online services, which generate and/or rely on huge amount of data. One core technique to deal with the unprecedented amount of data is the distributed storage systems that allow users/
openaire +2 more sources
2019
IPFS (Interplanetary File System) is a peer to peer method of storing content addressable data in distributed file system. To provide Fault Tolerance to important files, IPFS copies them on at least 3 nodes in different geographical areas. To store a file safely, IPFS consumes at least 3X more space. This is inefficient and can be reduced significantly
openaire +1 more source
IPFS (Interplanetary File System) is a peer to peer method of storing content addressable data in distributed file system. To provide Fault Tolerance to important files, IPFS copies them on at least 3 nodes in different geographical areas. To store a file safely, IPFS consumes at least 3X more space. This is inefficient and can be reduced significantly
openaire +1 more source
Understand how to make wireless communication networks, digital storage systems and computer networks robust and reliable in the first unified, comprehensive treatment of erasure correcting codes. Data loss is unavoidable in modern computer networks; as such, data recovery can be crucial and these codes can play a central role.
Enrico Paolini +3 more
openaire +1 more source
Enrico Paolini +3 more
openaire +1 more source
Finite-length analysis of low-density parity-check codes on the binary erasure channel
IEEE Transactions on Information Theory, 2002T J Richardson, Rüdiger Urbanke
exaly