Results 271 to 280 of about 4,215 (309)
Some of the next articles are maybe not open access.
2006 IEEE International Symposium on Information Theory, 2006
The design of erasure correcting codes and their decoding algorithms is now at the point where capacity achieving codes are available with decoding algorithms that have complexity that is linear in the number of information symbols. One aspect of these codes is that the overhead (number of coded symbols beyond the number of information symbols required
Chris Studholme, Ian F. Blake
openaire +1 more source
The design of erasure correcting codes and their decoding algorithms is now at the point where capacity achieving codes are available with decoding algorithms that have complexity that is linear in the number of information symbols. One aspect of these codes is that the overhead (number of coded symbols beyond the number of information symbols required
Chris Studholme, Ian F. Blake
openaire +1 more source
Erasure Decoding for Gabidulin Codes
Journal of Mathematical Modelling and Algorithms, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Regis F. Babindamana +1 more
openaire +2 more sources
Erasure Coding for Decentralized Coded Caching
2018 IEEE International Symposium on Information Theory (ISIT), 2018Coded caching can significantly decrease the communication load in peak hours of the network. The gain of caching is maximized in a centralized setting, where the cache content of users are opportunistically designed. In the absence of a centralized placement, users' caches are filled with randomly selected packets of the files.
Hadi Reisizadeh +2 more
openaire +1 more source
2013 IEEE International Symposium on Information Theory, 2013
In this paper, we study binary pattern erasure codes, i.e., binary codes that are resiliant to erasures from a family P of possible erasures. We give an algorithmic proof of the existence of a binary linear code with codewords of length n that is resiliant to erasures from P when P satisfies the properties: every pattern p ϵ P has size m and every ...
Sheng Lin 0002 +4 more
openaire +1 more source
In this paper, we study binary pattern erasure codes, i.e., binary codes that are resiliant to erasures from a family P of possible erasures. We give an algorithmic proof of the existence of a binary linear code with codewords of length n that is resiliant to erasures from P when P satisfies the properties: every pattern p ϵ P has size m and every ...
Sheng Lin 0002 +4 more
openaire +1 more source
Trellis codes for periodic erasures
IEEE Transactions on Communications, 2000Summary: 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.
Richard D. Wesel +2 more
openaire +2 more sources
Evaluating the Performance of Erasure Codes
2015 Third International Conference on Advanced Cloud and Big Data, 2015Recently, erasure codes such as Reed-Solomon (RS) code and Cauchy Reed-Solomon (CRS) code have been widely used in distributed file system to reduce the large storage overhead incurred by replication scheme. Now, there is a new erasure code called Binary Reed-Solomon (BRS) code that can achieve better performance than that of RS code, CRS code and is ...
Ping Lu 0008 +4 more
openaire +1 more source
Random Matrices and Codes for the Erasure Channel
Algorithmica, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chris Studholme, Ian F. Blake
openaire +1 more source
Decentralized erasure codes for distributed networked storage
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. Specifically, we assume that there are n storage nodes with limited memory and k < n sources generating the data.
Alexandros G Dimakis +1 more
exaly +1 more source
Coding in the Block-Erasure Channel
IEEE Transactions on Information Theory, 2006In this correspondence, we study an M-ary block-erasure channel with B blocks, where with probability epsi a block of L coded symbols is erased. The behavior of the error probability of coded systems over such channels is studied, and we show that, if the code is diversity-wise maximum-distance separable, its word error probability is equal to the ...
openaire +1 more source
Codes With Local Regeneration and Erasure Correction
IEEE Transactions on Information Theory, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Govinda M. Kamath +3 more
openaire +2 more sources