نتایج جستجو برای: erasure code

تعداد نتایج: 170515  

2015
Mingyuan Xia Mohit Saxena Mario Blaum David Pease

Distributed storage systems are increasingly transitioning to the use of erasure codes since they offer higher reliability at significantly lower storage costs than data replication. However, these codes tradeoff recovery performance as they require multiple disk reads and network transfers for reconstructing an unavailable data block. As a result, most existing systems use an erasure code eith...

2004
Gou HOSOYA Toshiyasu MATSUSHIMA Shigeichi HIRASAWA

We propose a new decoding algorithm of LDPC codes over the binary erasure channel (BEC). The proposed decoding algorithm is an iterative one which uses the sparseness structure of the parity-check matrix of LDPC codes. We show by simulation results that the proposed decoding algorithm and the conventional decoding algorithm have a trade-off between remaining erasure rate and complexity. Keyword...

Journal: :CoRR 2016
Wentu Song Kai Cai Chau Yuen

We consider the locally repairable codes (LRC), aiming at sequential recovering multiple erasures. We define the (n, k, r, t)SLRC (Sequential Locally Repairable Codes) as an [n, k] linear code where any t(≤ t) erasures can be sequentially recovered, each one by r (2 ≤ r < k) other code symbols. Sequential recovering means that the erased symbols are recovered one by one, and an already recovere...

2017
Wentu Song Kai Cai Chau Yuen Guangyue Han

We consider the locally repairable codes (LRC), aiming at sequentially recovering multiple erasures; in particular, we propose and study the so-called (n, k, r, t)-SLRC (Sequential Locally Repairable Codes) as an [n, k] linear code where any t (≤ t) erasures can be sequentially recovered, each by r (2 ≤ r < k) other code symbols. Here, a sequential recovering means that the erased symbols are r...

2008
Jon Hamkins

We make the simple observation that the erasure burst correction capability of any (n, k) code can be extended to arbitrary lengths above n with the use of a block interleaver, and discuss nuances of this property when channel symbols are over GF(p) and the code is defined over GF(p ), J > 1. The results imply that maximum distance separable codes (e.g., Reed-Solomon) offer optimal burst erasur...

Journal: :IEEE Journal on Selected Areas in Communications 2009

Journal: :JSW 2014
Yong Zeng Xin Wang Zhihong Liu Jianfeng Ma Lihua Dong

Code dissemination is very useful to remotely fix bugs or add now functions in wireless sensor networks (WSNs) after sensors deployed. Hostile environments keep the secure code dissemination a major concern. The Delugebased protocols are the widely used code disseminations, however, which have to take much energy and memory to deal with the problem caused by out of order delivery of packets in ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید