Results 221 to 230 of about 3,348 (257)
Some of the next articles are maybe not open access.
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
Codes with efficient erasure correction
2020Distributed 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
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
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
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
Turbo Codes in Binary Erasure Channel
IEEE Transactions on Information Theory, 2008In this correspondence, the stopping set of turbo codes with iterative decoding in the binary erasure channel is defined. Block and bit erasure probabilities of turbo codes are studied by using the stopping set analysis. It is found that block and bit erasure probabilities of turbo codes with iterative decoding are higher than those with maximum ...
Lee, J.W., Urbanke, R., Blahut, R.E.
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