Results 21 to 30 of about 4,215 (309)
On erasure combinatorial batch codes
Advances in Mathematics of Communications, 2018 Combinatorial batch codes were defined by Paterson, Stinson, and Wei as purely combinatorial versions of the batch codes introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai. There are $n$ items and $m$ servers, each of which stores a subset of the items. A batch code is an arrangement for storing items on servers so that, for prescribed integers $k$
JiYoon Jung +3 more
openaire +3 more sources
Efficient erasure correcting codes [PDF]
IEEE Transactions on Information Theory, 2001 Summary: We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discrete-time random process. As a result, we obtain a simple criterion involving the fractions of nodes of different degrees on both sides of the graph which is necessary and ...
Michael Luby +3 more
openaire +1 more source
IEEE Access, 2019 With the growing demand, wireless sensor networks (WSNs) play an increasingly important role in many fields. The focus has been on deploying Luby transform (LT) codes in WSNs because of their inherent advantages in erasure channels.
Chuang Wang +4 more
doaj +1 more source
Rate adaptive binary erasure quantization with dual fountain codes [PDF]
, 2008 —In this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that the source coding dual of the binary erasure channel coding problem, binary ...
Mohamed Ismail +8 more
core +1 more source
Delay-Universal Channel Coding With Feedback
IEEE Access, 2018 In this paper, the design of error-correcting or channel codes for delay-universal/anytime communication is shown while considering systems with and without a feedback link.
Md. Noor-A-Rahim +5 more
doaj +1 more source
Codes With Locality for Two Erasures
IEEE Transactions on Information Theory, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
N. Prakash 0001 +3 more
openaire +2 more sources
Secure erasure codes with partial decodability [PDF]
2015 IEEE International Conference on Communications (ICC), 2015 11 ...
Son Hoang Dau, Wentu Song, Chau Yuen
openaire +2 more sources
On-the-fly erasure coding for real-time video applications [PDF]
, 2011 This paper introduces a robust point-to-point transmission scheme: Tetrys, that relies on a novel on-the-fly erasure coding concept which reduces the delay for recovering lost data at the receiver side.In current erasure coding schemes, the packets that ...
Emmanuel Lochin +10 more
core +1 more source
Geo-aware erasure coding for high-performance erasure-coded storage clusters [PDF]
Annals of Telecommunications, 2018 Erasure code-based distributed storage systems are increasingly being used by storage providers for big data storage since they offer the same reliability as replication with a significant decrease in the amount of storage required. But, when it comes to a storage system with data nodes spread across a very large geographical area, the node’s recovery ...
Lakshmi J. Mohan +3 more
openaire +2 more sources
Erasure coding for distributed storage: an overview [PDF]
Science China Information Sciences, 2018 In a distributed storage system, code symbols are dispersed across space in nodes or storage units as opposed to time. In settings such as that of a large data center, an important consideration is the efficient repair of a failed node. Efficient repair calls for erasure codes that in the face of node failure, are efficient in terms of minimizing the ...
Balaji Srinivasan Babu +5 more
openaire +3 more sources