Results 21 to 30 of about 1,793 (257)
Codes With Locality for Two Erasures
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
N. Prakash 0001 +3 more
openaire +2 more sources
Secure Network Coding With Erasures and Feedback [PDF]
Secure network coding assumes that the underlying network links are lossless, thus it can be applied over lossy networks after channel error correction. Yet it is well known that channel losses, such as packet erasures, can be constructively used for secrecy over a link.
Laszlo Czap +3 more
openaire +3 more sources
Secure erasure codes with partial decodability [PDF]
11 ...
Son Hoang Dau, Wentu Song, Chau Yuen
openaire +2 more sources
Geo-aware erasure coding for high-performance erasure-coded storage clusters [PDF]
Erasure code-based distributed storage systems are increasingly being used by storage providers for big data storage since they offer the same reliability as replication with a significant decrease in the amount of storage required. But, when it comes to a storage system with data nodes spread across a very large geographical area, the node’s recovery ...
Lakshmi J. Mohan +3 more
openaire +2 more sources
VLSI Architectures for Reed–Solomon Codes: Classic, Nested, Coupled, and Beyond
Classic Reed-Solomon (RS) codes and binary Bose-Chaudhuri-Hocquenghem (BCH) codes, which can be considered as a special case of RS codes, are utilized for error correction in numerous systems, such as Flash memories, optical communications, wireless ...
Xinmiao Zhang
doaj +1 more source
Low-cost Multi-node Failure Repair Method for Erasure Codes [PDF]
Current erasure code repair methods have problems such as high expenses and low efficiency.Aiming at these problems,this paper brings forward a multi-node failure repair method with low cost.By means of network distance based node choosing method ...
ZHENG Liming,LI Xiaodong
doaj +1 more source
Erasure coding for distributed storage: an overview [PDF]
In a distributed storage system, code symbols are dispersed across space in nodes or storage units as opposed to time. In settings such as that of a large data center, an important consideration is the efficient repair of a failed node. Efficient repair calls for erasure codes that in the face of node failure, are efficient in terms of minimizing the ...
Balaji Srinivasan Babu +5 more
openaire +3 more sources
Codes for erasures over directed graphs [PDF]
5 pages, ITW 2017 ...
Lev Yohananov, Eitan Yaakobi
openaire +2 more sources
Hierarchical erasure correction of linear codes [PDF]
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
Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes [PDF]
We introduce a new class of qubit codes that we call Evenbly codes, building on a previous proposal of hyperinvariant tensor networks. Its tensor network description consists of local, non-perfect tensors describing CSS codes interspersed with Hadamard ...
Matthew Steinberg +5 more
doaj +1 more source

