Results 11 to 20 of about 35,120 (283)
Erasure coding for real-time streaming [PDF]
2012 IEEE International Symposium on Information Theory Proceedings, 2012 We consider a real-time streaming system where messages are created sequentially at the source, and are encoded for transmission to the receiver over a packet erasure link. Each message must subsequently be decoded at the receiver within a given delay from its creation time.
Leong, Derek, Ho, Tracey
openaire +6 more sources
Decentralized erasure codes for distributed networked storage [PDF]
IEEE Transactions on Information Theory, 2006 We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed.
Dimakis, Alexandros G. +2 more
openaire +4 more sources
FNT-Based Reed-Solomon Erasure Codes [PDF]
2010 7th IEEE Consumer Communications and Networking Conference, 2010 This paper presents a new construction of Maximum-Distance Separable (MDS) Reed-Solomon erasure codes based on Fermat Number Transform (FNT). Thanks to FNT, these codes support practical coding and decoding algorithms with complexity O(n log n), where n is the number of symbols of a codeword.
Soro, Alexandre, Lacan, Jérôme
openaire +3 more sources
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
Hierarchical erasure correction of linear codes [PDF]
Finite Fields and Their Applications, 2020 Linear codes over finite extension fields have widespread applications in theory and practice. In some scenarios, the decoder has a sequential access to the codeword symbols, giving rise to a hierarchical erasure structure. In this paper we develop a mathematical framework for hierarchical erasures over extension fields, provide several bounds and ...
Netanel Raviv +3 more
openaire +3 more sources
Systematic MDS erasure codes based on vandermonde matrices [PDF]
, 2004 An increasing number of applications in computer communications uses erasure codes to cope with packet losses. Systematic maximum-distance separable (MDS) codes are often the best adapted codes.
Fimes, Jérôme, Lacan, Jérôme
core +2 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 ...
Luby, Michael G. +3 more
openaire +1 more source
IEEE Transactions on Information Theory, 2017 To appear in IEEE International Symposium on Information ...
Lev Yohananov, Eitan Yaakobi
openaire +2 more sources
Codes with locality for two erasures [PDF]
2014 IEEE International Symposium on Information Theory, 2014 In this paper, we study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. By a local parity-check computation, we mean recovery via a single parity-check equation associated to small Hamming weight.
Prakash, N. +2 more
openaire +2 more sources
eCMT-SCTP: Improving Performance of Multipath SCTP with Erasure Coding Over Lossy Links [PDF]
, 2013 Performance of transport protocols on lossy links is a well-researched topic, however there are only a few proposals making use of the opportunities of erasure coding within the multipath transport protocol context.
Boreli, Roksana +3 more
core +2 more sources