Results 231 to 240 of about 1,634 (262)

Codes correcting phased burst erasures

Proceedings of 19th Convention of Electrical and Electronics Engineers in Israel, 1998
Summary: We introduce a family of binary array codes of size \(t\times n\), correcting multiple phased burst erasures of size \(t\). The codes achieve maximal correcting capability, i.e., being considered as codes over \(GF(2^t)\) they are MDS. The length of the codes is \(n= \sum^L_{l=1} {t\choose l}\) where \(L\) is a constant or is slowly growing in
Keren, Osnat, Litsyn, Simon
openaire   +2 more sources

Erasure Codes for IPFS

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

Trellis codes for periodic erasures

IEEE Transactions on Communications, 2000
Summary: This paper describes techniques for the design and analysis of trellis codes that provide reliable communication over every channel in a specified set of possible channels, where each channel is characterized by additive white Gaussian noise with a distinct periodic variation in signal-to-noise ratio.
Wesel, Richard D., Liu, Xueting, Shi, Wei   +2 more
openaire   +2 more sources

When paxos meets erasure code

Proceedings of the 23rd international symposium on High-performance parallel and distributed computing, 2014
Paxos-based state machine replication is a key technique to build highly reliable and available distributed services, such as lock servers, databases and other data storage systems. Paxos can tolerate any minority number of node crashes in an asynchronous network environment.
Shuai Mu, Kang Chen, Yongwei Wu, Weimin Zheng   +3 more
openaire   +1 more source

Erasure Coding in Object Stores

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018
Recent 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   +1 more source

Codes with efficient erasure correction

2020
Distributed storage systems are becoming increasingly ubiquitous in the emerging era of Internet of Things. Major internet technology companies employ large-scale distributed storage systems to accommodate the massive amounts of data generated and requested by global users. The need of reliable and efficient storage of immense amounts of data calls for
openaire   +2 more sources

EraRFID: Reliable RFID systems using erasure coding

2015 IEEE International Conference on RFID (RFID), 2015
Current RFID systems are not utterly reliable as they may fail to read all the tags present in their RF field of view, particularly when dealing with bulk tag reading in messy situations. To enable reliable tag inventories, we put forward the concept of RFID tag grouping, i.e., logically coupling tags thus forming a consistent group.
Ben Mabrouk, Nebil, Couderc, Paul
openaire   +2 more sources

Coding Performance with Imperfect Erasures

MILCOM 1985 - IEEE Military Communications Conference, 1985
Convolutional coding with interleaving is frequently employed to obtain low decoded bit error rates in the presence of intermittent interference. It is well-known that the performance of the code is enhanced if the jammed bits are identified and erased. However, this enhancement is substantially reduced if the process of identification is imperfect. In
openaire   +1 more source

Burst erasure correcting LDPC codes

IEEE Transactions on Communications, 2009
In this paper low-density parity-check (LDPC) codes are designed for burst erasure channels. Firstly, lower bounds for the maximum length erasure burst that can always be corrected with message-passing decoding are derived as a function of the parity-check matrix properties. We then show how parity-check matrices for burst erasure correcting LDPC codes
openaire   +1 more source

Erasure Coding for Big Data

Advanced Computing and Communications, 2019
This article deals with the reliable and efficient storage of ‘Big Data’, by which is meant the vast quantities of data that are stored in data centers worldwide. Given that storage units are prone to failure, to protect against data loss, data pertaining to a data file is stored in distributed and redundant fashion across multiple storage units. While
openaire   +1 more source