Results 241 to 250 of about 35,120 (283)
Programmable electron-induced color router array. [PDF]
Light Sci ApplChi C +6 more
europepmc +1 more source
Laser writing in glass for dense, fast and efficient archival data storage. [PDF]
NatureMicrosoft Research Project Silica Team.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 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 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.
Babindamana, Regis F. +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 +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 +4 more
openaire +1 more source
Cyclic repetition erasure code
2013 3rd International Conference on Consumer Electronics, Communications and Networks, 2013Distributed storage systems introduce redundancy to provide high data reliability, a simple strategy is replication, but it has a drawback of low storage efficiency, another popular strategy is using erasure code, but the repair cost and complexity are very high.
Meng-Fei Zhang, Shu-Tao Xia
openaire +1 more source