Results 11 to 20 of about 1,634 (262)
Erasure Codes for Cold Data in Distributed Storage Systems
Applied Sciences, 2023 Replication and erasure codes are always used for storing large amounts of data in distributed storage systems. Erasure code technology can maximize the storage space of distributed storage systems as well as guaranteeing their availability and ...
Chao Yin +5 more
doaj +1 more source
An Ant Colony Optimization Based Data Update Scheme for Distributed Erasure-Coded Storage Systems
IEEE Access, 2020 Owing to the high availability and space-efficiency of erasure codes, they have become the de facto standard to provide data durability in large scale distributed storage systems.
Yupeng Hu, Qian Li, Wei Xie, Zhenyu Ye
doaj +1 more source
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
An Optimal Recovery Approach for Liberation Codes in Distributed Storage Systems
IEEE Access, 2020 To reduce the storage cost, distributed storage systems are gradually using erasure codes to ensure data reliability. Liberation codes, which satisfy the maximum distance separable (MDS) property and provide optimal modification overhead, are a class of ...
Ningjing Liang +4 more
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 ...
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
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
IEEE Access, 2019 With the growing demand, wireless sensor networks (WSNs) play an increasingly important role in many fields. The focus has been on deploying Luby transform (LT) codes in WSNs because of their inherent advantages in erasure channels.
Chuang Wang +4 more
doaj +1 more source
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$
Jung, Ji Yoon +3 more
openaire +3 more sources