Results 11 to 20 of about 3,348 (257)
Analog coding of a source with erasures [PDF]
2016 IEEE International Symposium on Information Theory (ISIT), 2016 Analog coding decouples the tasks of protecting against erasures and noise. For erasure correction, it creates an "analog redundancy" by means of band-limited discrete Fourier transform (DFT) interpolation, or more generally, by an over-complete expansion based on a frame.
Marina Haikin, Ram Zamir
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.
N. Prakash 0001 +2 more
openaire +2 more sources
IEEE Transactions on Information Theory, 2017 To appear in IEEE International Symposium on Information ...
Lev Yohananov, Eitan Yaakobi
openaire +2 more sources
BPR: An Erasure Coding Batch Parallel Repair Approach in Distributed Storage Systems
IEEE Access, 2023 Today, Erasure Coding is one of the most significant techniques widely used in distributed systems because it can improve reliability for large amounts of data with low storage overhead.
Ying Song, Wenxuan Zhao, Bo Wang
doaj +1 more source
On erasure correction coding for streaming [PDF]
2012 Information Theory and Applications Workshop, 2012 We consider packet erasure correction coding for a streaming system where specific information needs to be decoded by specific deadlines, in order to ensure uninterrupted playback at the receiver. In our previous work [1], we gave a capacity-achieving code construction for the case of a fixed number of erasures.
Tekin, Ömer Faruk +3 more
openaire +3 more sources
Codes for the quantum erasure channel [PDF]
Physical Review A, 1997 6 pages, RevTeX, no figures, submitted to Physical Review A, code extended to encode 2 qubits, references ...
Grassl, Markus +2 more
openaire +2 more sources
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
FPGA-based Software and Hardware Cooperative Acceleration Scheme of Erasure Code Encoding [PDF]
Jisuanji gongchengThe erasure code fault-tolerant technology is widely used in current distributed storage systems. Compared with the multicopy fault-tolerant technology, the erasure code can not only significantly reduce the data storage costs, but can also provide ...
Sijie YANG, Junqi CHEN, Yong WANG, Shulin LI
doaj +1 more source
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
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