Filters








14,769 Hits in 4.1 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).  ...  This reduction in the search space has allowed us to find the most fault-tolerant codes for larger codes than was previously thought feasible.  ...  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

Survey on Network Coding for Multiple Cloud Storage

Hemanth kumar
2015 International Journal on Recent and Innovation Trends in Computing and Communication  
Therefore new design problem arises when erasure codes are used. However, regenerating codes shows better solution for this problem.  ...  There exists many codes, which performs striping of data, erasure coding is an example where provides good redundancy. However, the erasure codes perform recovery of whole file rather a single block.  ...  ., (n-k) for n=4 and k=2. The amount of space occupied by data is very less when erasure coding scheme is applied for multiple cloud storage set up.  ... 
doi:10.17762/ijritcc2321-8169.150318 fatcat:yi2qz6kagrflrffvcfb62jhxl4

Repair for distributed storage systems with erasure channels

Majid Gerami, Ming Xiao
2013 2013 IEEE International Conference on Communications (ICC)  
We show that in addition to reducing repair bandwidth, increasing storage space can also increase reliability for repair.  ...  For a limited number of transmission, we study the probability of successful regenerating.  ...  Other related works on network coding for erasure networks are as follows. The capacity of wireless erasure networks has been studied in [7] .  ... 
doi:10.1109/icc.2013.6655195 dblp:conf/icc/GeramiX13 fatcat:ax4orpxceneqbcdmrt3wu6vpyq

Joint Use of Custody Transfer and Erasure Codes in DTN Space Networks: Benefits and Shortcomings

Tomaso de Cola, Mario Marchese
2010 2010 IEEE Global Telecommunications Conference GLOBECOM 2010  
On the other hand, the implementation of long erasure codes proved to be promising to contrast short fading events in long delay networks, where the high latency makes the use of ARQ schemes less profitable  ...  This paper proposes a protocol design to incorporate long erasure codes into the Bundle Protocol specification.  ...  Recent findings in coding theory showed that LDPC (Low Density Parity Check) schemes are particularly efficient, thanks to the low encoding/decoding complexity and the high recovery capacity [13] .  ... 
doi:10.1109/glocom.2010.5683307 dblp:conf/globecom/ColaM10 fatcat:fitqpylub5eepha2uaklgu64ke

On locality of Generalized Reed-Muller codes over the broadcast erasure channel [article]

Amira Alloum, Sian-Jheng Lin, Tareq Y.Al-Naffouri
2016 arXiv   pre-print
One to Many communications are expected to be among the killer applications for the currently discussed 5G standard.  ...  Beyond reusing, extending or adapting existing application layer packet coding mechanisms based on previous schemes and designed for the foregoing LTE or other broadcasting standards; our purpose is to  ...  During this phase, coding can be used on the top of TCP protocol for uni-cast communication where network codes or rateless codes can be used on top of physical layer in a separate or a cross layer approach  ... 
arXiv:1609.03173v1 fatcat:rerwxk5tnjatlbg5zologkryhy

Variable shortened-and-punctured Reed-Solomon codes for packet loss protection

Youshi Xu, Tingting Zhang
2002 IEEE transactions on broadcasting  
A VLSI implementation for erasure decoding of the proposed variable RS code is described and the achievable performance is quantitatively analyzed.  ...  erasures.  ...  Pettersson for useful discussions, and two anonymous referees for helpful comments and suggestions.  ... 
doi:10.1109/tbc.2002.803706 fatcat:zbf5tfffw5d3hammv67n34wloa

Systematic MDS Erasure Codes Based on Vandermonde Matrices

J. Lacan, J. Fimes
2004 IEEE Communications Letters  
An increasing number of applications in computer communications uses erasure codes to cope with packet losses. Systematic maximum-distance separable (MDS) codes are often the best adapted codes.  ...  This letter introduces new systematic MDS erasure codes constructed from two Vandermonde matrices. These codes have lower coding and decoding complexities than the others systematic MDS erasure codes.  ...  INTRODUCTION T HE recent past has shown a wide use of error-correcting codes in several kinds of computer communications like real-time [1] , [2] , multicast ones [3] , [4] or distributed storage  ... 
doi:10.1109/lcomm.2004.833807 fatcat:swvwpqexdrdxtpfwhmu6tkxx6a

Families of Optimal Binary Non-MDS Erasure Codes [article]

Danilo Gligoroski, Katina Kralevska
2016 arXiv   pre-print
We introduce a definition for Families of Optimal Binary Non-MDS Erasure Codes for [n, k] codes over GF(2), and propose an algorithm for finding those families by using hill climbing techniques over Balanced  ...  We also show a surprising result that for small values of k, the decoding probability of our codes in GF(2) is very close to the decoding probability of the codes obtained by Random Linear Network Coding  ...  Jensen for their discussions that improved the quality of this paper. We would also like to thank the anonymous reviewers for their useful comments and suggestions.  ... 
arXiv:1609.02460v1 fatcat:ptjs3igoqfg6jmpyuqwx7xiiju

Fountain Coded Wireless Transmission Model

Anmol Singh Brar, Amandeep Singh Sandhu
2016 Indian Journal of Science and Technology  
like overhead and space required for storage.  ...  Background/Objectives: Rateless codes have recently attracted much engrossment in community communication research as the Luby Transform codes and Raptor codes are most renowned.  ...  Future studies can be performed on setting of different parameters for yielding viable robust communication.  ... 
doi:10.17485/ijst/2016/v9i14/86604 fatcat:m2kic35m2rcjznnz4d5mi4ukde

On the Queueing Behavior of Random Codes over a Gilbert-Elliot Erasure Channel [article]

Parimal Parag, Jean-Francois Chamberland, Henry D. Pfister, Krishna R. Narayanan
2010 arXiv   pre-print
., fluid models) or assumes error-free communication using finite codes. This work enables one to determine when such assumptions provide good, or bad, approximations of true behavior.  ...  This paper considers the queueing performance of a system that transmits coded data over a time-varying erasure channel.  ...  Recent results in the literature hint at the fact that, for delay-constrained communication, optimal code-rate selection depends heavily on block-length and channel correlation [8] , [9] .  ... 
arXiv:1006.2403v1 fatcat:atydif2o5zdfpoavss3zc6xh5y

On the queueing behavior of random codes over a gilbert-elliot erasure channel

Parimal Parag, Jean-Francois Chamberland, Henry D. Pfister, Krishna R. Narayanan
2010 2010 IEEE International Symposium on Information Theory  
., fluid models) or assumes error-free communication using finite codes. This work enables one to determine when such assumptions provide good, or bad, approximations of true behavior.  ...  This paper considers the queueing performance of a system that transmits coded data over a time-varying erasure channel.  ...  Recent results in the literature hint at the fact that, for delay-constrained communication, optimal code-rate selection depends heavily on block-length and channel correlation [8] , [9] .  ... 
doi:10.1109/isit.2010.5513296 dblp:conf/isit/ParagCPN10 fatcat:gl6vkph64fgc5awgmzqgcrhwqm

Reliable broadband communication using a burst erasure correcting code

A. J. McAuley
1990 Computer communication review  
This paper describes a simplified Reed-Solomon erasure correction coder architecture, adapted for congestion loss in a broadband network.  ...  Traditionally, a transport protocol corrects errors in a computer communication network using a simple ARQ protocol.  ...  ACKNOWLEDGEMENTS The ideas in this paper were developed and refined with much help from other members of the Computer Communication Research Group at Bellcore, particularly: Ernst Biersack, Chase Cotton  ... 
doi:10.1145/99517.99566 fatcat:2grtzukjtfdkpo6r477iam3tqm

Reliable broadband communication using a burst erasure correcting code

A. J. McAuley
1990 Proceedings of the ACM symposium on Communications architectures & protocols - SIGCOMM '90  
This paper describes a simplified Reed-Solomon erasure correction coder architecture, adapted for congestion loss in a broadband network.  ...  Traditionally, a transport protocol corrects errors in a computer communication network using a simple ARQ protocol.  ...  ACKNOWLEDGEMENTS The ideas in this paper were developed and refined with much help from other members of the Computer Communication Research Group at Bellcore, particularly: Ernst Biersack, Chase Cotton  ... 
doi:10.1145/99508.99566 dblp:conf/sigcomm/McAuley90 fatcat:h2ulao5onnc3xnnzgn5tpgw3jq

A Survey on Network-Aware Feasible Repairs for Erasure-Coded Storage

M. Preetha
2019 International Journal for Research in Applied Science and Engineering Technology  
Recent researches on erasure coding for distributed storages have shown us various error detection and correction methods and strategies.  ...  We review related work on the repair problem for erasure coding based distributed storage system.  ...  In this concept, a random linear coding based strategy can be called erasure coding on the fly. G.  ... 
doi:10.22214/ijraset.2019.4524 fatcat:qqlnyyfd4rbfzje6kjbxkv6hie

Performance Comparison of Two Inner Coding Structures in Concatenated Codes for Frequency-Hopping Spread Spectrum Multiple-Access Communications

Ye Hoon
2015 International Journal on Recent and Innovation Trends in Computing and Communication  
In this paper, we compare the performance of two inner coding structures for concatenated codes in slow frequencyhopping spread spectrum multiple-access communication systems.  ...  The first structure consists of one inner codeword per one outer code symbol, while the second structure consists of one inner codeword per two outer code symbols.  ...  Concatenated codes became widely used in space communications in the 1970s and recently adopted in Digital Television Terrestrial Broadcasting (DTTB) [3] .  ... 
doi:10.17762/ijritcc2321-8169.150264 fatcat:nzir7uie7fb6xfvyu5iy45pbwe
« Previous Showing results 1 — 15 out of 14,769 results