Filters








7,226 Hits in 5.2 sec

Finding the most fault-tolerant flat XOR-based erasure codes for storage systems

Jay J. Wylie
2011 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)  
These techniques substantially reduce the search space for finding fault-tolerant codes (e.g., by a factor of over 52 trillion in one case).  ...  The result of our effort to find the most fault-tolerant flat XOR-based erasure codes for storage systems has yielded a corpus of 49,215 erasure codes that we are making public.  ...  ACKNOWLEDGMENTS Thanks to my key collaborators on erasure codes research over the last five years (Kevin Greenan, Jim Plank, Ram Swaminathan) for feedback, ideas and discussions that lead to these results  ... 
doi:10.1109/acssc.2011.6190329 dblp:conf/acssc/Wylie11 fatcat:gcangyjrdzgehkdryq64mr6rni

Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes [article]

E. Paolini, M. Chiani
2008 arXiv   pre-print
The design method consists in starting from the parity-check matrix of an LDPC code and developing an optimized parity-check matrix, with the same performance on the memory-less erasure channel, and suitable  ...  If the input parity-check matrix is designed for achieving good performance on the memory-less erasure channel, then the code obtained after the application of the PSS algorithm provides good joint correction  ...  This pivot searching algorithm is exploited in the optimization algorithm for LDPC codes on burst erasure channels, presented in the next section.  ... 
arXiv:0810.1197v1 fatcat:26oz637cxvb2bfptgazjaljdpe

H-ARQ Rate-Compatible Structured LDPC Codes

Mostafa El-Khamy, Jilei Hou, Naga Bhushan
2006 2006 IEEE International Symposium on Information Theory  
These codes have a good performance on the AWGN channel and are robust against erasures and puncturing.  ...  We devise a systematic technique of low complexity for the design of structured low-rate LDPC codes from higher rate ones.  ...  These codes should have good performance on both AWGN and erasure channels.  ... 
doi:10.1109/isit.2006.261961 dblp:conf/isit/El-KhamyHB06 fatcat:vzf5qnmqpjgpjpvi56vyc5vmqa

Optimal Finite Length Coding Rate of Random Linear Network Coding Schemes [article]

Tan Do-Duy, M. Ángeles Vázquez-Castro
2018 arXiv   pre-print
Specifically, we model the finite-length performance for random linear capacity-achieving schemes: non-systematic (RLNC) and systematic (SNC) and non-capacity achieving schemes: SNC with packet scheduling  ...  Then, we propose a binary searching algorithm to identify optimal coding rate for given target packet loss rate.  ...  RANDOM LINEAR NETWORK CODING SCHEMES A. Non-Systematic For block coding, we consider RLNC and SNC, where information packets are grouped into equally-sized blocks of length K packets.  ... 
arXiv:1805.05783v1 fatcat:fpanm5dqkzcovhimddkvvzyh7y

Erasure Codes with a Banded Structure for Hybrid Iterative-ML Decoding

Alexandre Soro, Mathieu Cunche, Jerome Lacan, Vincent Roca
2009 GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference  
on the erasure channel.  ...  The combination of these two decoding algorithms leads to erasure codes achieving a very good trade-off between complexity and erasure correction capability.  ...  These codes can be seen as a non systematic LDGM codes with 2log(k) elements per column. Because it is a non-systematic code, iterative decoding cannot be used (unlike standard LDGM codes).  ... 
doi:10.1109/glocom.2009.5426098 dblp:conf/globecom/SoroCLR09 fatcat:3pyfoametne3za7cihuqvb7j4m

Burst Erasure Correction Codes With Low Decoding Delay

E. Martinian, C.-E.W. Sundberg
2004 IEEE Transactions on Information Theory  
In addition, we show that the new encoders can achieve better performance than MDS codes on a simple two-state Markov erasure channel.  ...  We present a new class of systematic, time-invariant, convolutional encoders suitable for low delay burst erasure correction.  ...  Hence, any burst of 2 erasures can be corrected with delay 4 because the burst can only erase one of the two non-zero symbols in any non-zero codeword.  ... 
doi:10.1109/tit.2004.834844 fatcat:6chvfte5rfhpzpzab42cpn26pi

Balanced Locally Repairable Codes [article]

Katina Kralevska, Danilo Gligoroski, Harald Øverby
2017 arXiv   pre-print
Similar to other locally repairable codes (LRCs), the presented codes are suitable for applications that require a low repair locality.  ...  Additionally, the relaxed locality criteria gives us an opportunity to search for BLRCs that have a low repair locality even when double failures occur.  ...  Note that if one systematic block and w parity blocks that are linear combinations of the specific systematic block fail, then the systematic block is non-recoverable.  ... 
arXiv:1607.04137v3 fatcat:k5c5f5uldjbkfh2cbydxvu5z4i

Erasure Codes with a Banded Structure for Hybrid Iterative-ML Decoding [article]

Alexandre Soro, Mathieu Cunche, Jerome Lacan, Vincent Roca
2009 arXiv   pre-print
on the erasure channel.  ...  The combination of these two decoding algorithms leads to erasure codes achieving a very good trade-off between complexity and erasure correction capability.  ...  These codes can be seen as a non systematic LDGM codes with 2log(k) elements per column. Because it is a non-systematic code, iterative decoding cannot be used (unlike standard LDGM codes).  ... 
arXiv:0901.3467v1 fatcat:dturvr7uiraxdnuhka4hvh2yqm

CloudS: A Multi-Cloud Storage System with Multi-Level Security

Lu SHEN, Shifang FENG, Jinjin SUN, Zhongwei LI, Ming SU, Gang WANG, Xiaoguang LIU
2016 IEICE transactions on information and systems  
But non-systematic codes like RS require relatively complex arithmetic, and systematic codes have relatively weaker security.  ...  • Design a family of XOR-based non-systematic coding schemes called Privacy Protecting Code (PPC) and im-  ...  However, traditional erasure codes are generally systematic codes whose security is relatively weak, and non-systematic codes like multi-erasure RS require relatively complex finite field arithmetic, besides  ... 
doi:10.1587/transinf.2015inp0009 fatcat:hkfdnr5fpjclzaifgvxbtzb6lq

Coded Packet Transport for Optical Packet/Burst Switched Networks [article]

Katina Kralevska, Harald Oeverby, Danilo Gligoroski
2016 arXiv   pre-print
In the CPT scheme, erasure coding is employed at the OPS/OBS ingress node to form coded packets, which are transmitted on disjoint paths from the ingress node to an egress node in the network.  ...  provide non-cryptographic secrecy.  ...  The CPT scheme is based on Forward Error Correction (FEC) codes used as erasure codes and provides non-cryptographic secrecy.  ... 
arXiv:1601.07036v1 fatcat:3672lech6naknlcnjdh65k42n4

LT Codes For Efficient and Reliable Distributed Storage Systems Revisited [article]

Yongge Wang
2012 arXiv   pre-print
We will show the equivalence between the edge-colored graph model and degree-one-and-two encoding symbols based array BP-XOR codes.  ...  This paper carries out the theoretical analysis on the feasibility and performance issues for applying LT codes to distributed storage systems.  ...  ACKNOWLEDGEMENTS I would like to thank Duan Qi for some discussion on Hamming code and Theorem 4.2 and thank Prof.  ... 
arXiv:1207.5542v1 fatcat:l74zsf5gavgvpdsfs7bw62vqpi

LDPC code design for transmission of correlated sources across noisy channels without CSIT

Arvind Yedla, Henry D. Pfister, Krishna R. Narayanan
2010 2010 6th International Symposium on Turbo Codes & Iterative Information Processing  
Using differential evolution, we design punctured systematic LDPC codes to maximize the region of achievable channel conditions, with joint iterative decoding.  ...  Index Terms-LDPC codes, density evolution, correlated sources, non-systematic encoders, joint decoding, differential evolution. I.  ...  Erasure Correlation We designed LDPC codes for the erasure channel, when the sources are correlated with an erasure probability of p = 0.5.  ... 
doi:10.1109/istc.2010.5613829 fatcat:qlwrg4pglrcahc4akhdju4efgm

LDPC Code Design for Transmission of Correlated Sources Across Noisy Channels Without CSIT [article]

Arvind Yedla, Henry D. Pfister, Krishna R. Narayanan
2010 arXiv   pre-print
Using differential evolution, we design punctured systematic LDPC codes to maximize the region of achievable channel conditions, with joint iterative decoding.  ...  Index Terms-LDPC codes, density evolution, correlated sources, non-systematic encoders, joint decoding, differential evolution. I.  ...  This condition is clearly not satisfied when we use a systematic LDPC ensemble. This also explains the loss in performance of systematic LDPC codes when compared to Turbo codes, as shown in [8] .  ... 
arXiv:1007.0931v1 fatcat:wxcfpaqj3bcqzoprpz2ui7uwkm

Joint video adaptation and erasure code for video broadcast in wireless networks

NengQiang He, XueDan Zhang, YiPeng Li, JianNong Cao, Zhu Li, Yong Ren
2012 Science China Information Sciences  
For practical implementation, we have designed the joint video adaptation and erasure code (JVEC) with lower complexity, which can generate erasure codes on the fly to guarantee the decoding of important  ...  Keywords wireless video broadcast, erasure code, video analysis Citation He N Q, Zhang X D, Li Y P, et al. Joint video adaptation and erasure code for video broadcast in wireless networks.  ...  In this paper, based on video packets' decoding dependency and their distortions, we propose the greedy video erasure code (GVEC) which searches for the optimal erasure code to minimize average video distortion  ... 
doi:10.1007/s11432-012-4642-3 fatcat:bnmpvwvacfa3jotunsdo3rnxwq

Adaptive network coding for broadcast channels

P. Sadeghi, D. Traskov, R. Koetter
2009 2009 Workshop on Network Coding, Theory, and Applications  
We consider the throughput-delay tradeoff in network coded transmission over erasure broadcast channels.  ...  In particular, we investigate channels with memory and propose algorithms that can exploit channel erasure dependence to increase throughput and decrease delay.  ...  Such approaches based on local search are developed in [8] , [9] and performance bounds are derived.  ... 
doi:10.1109/netcod.2009.5191398 fatcat:2f5r2l5pine37pe3jbaf2l7vbm
« Previous Showing results 1 — 15 out of 7,226 results