Decentralized Erasure Codes for Distributed Networked Storage

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

to appear in IEEE Transactions on Information Theory, Special Issue: Networking and Information Theory

Scientific paper

We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes with limited memory and k

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Decentralized Erasure Codes for Distributed Networked Storage does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decentralized Erasure Codes for Distributed Networked Storage, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decentralized Erasure Codes for Distributed Networked Storage will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-647763

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.