@inproceedings{0c288b9d1251444ab45c7643c54f151f,
title = "Treeplication: An erasure code that is almost as painless as replication",
abstract = "This paper presents a new erasure code called Treeplication which features the benefits of both coding and replication. A Treeplication code for k data fragments is defined on a binary tree with 2k − 1 vertices, along with a distribution for selecting code fragments from the tree layers. The tree structure allows to optimize the recoverability of random subsets of code fragments, while at the same time behaving similarly to replication in recovering individual data fragments. The significant performance advantages over both replication and existing erasure codes motivate the use of Treeplication in decentralized distributed storage systems.",
author = "Michael Gandelman and Yuval Cassuto",
note = "Publisher Copyright: {\textcopyright} 2018 IEEE Information Theory Workshop, ITW 2018. All rights reserved.; 2018 IEEE Information Theory Workshop, ITW 2018 ; Conference date: 25-11-2018 Through 29-11-2018",
year = "2018",
month = jul,
day = "2",
doi = "10.1109/ITW.2018.8613396",
language = "الإنجليزيّة",
series = "2018 IEEE Information Theory Workshop, ITW 2018",
booktitle = "2018 IEEE Information Theory Workshop, ITW 2018",
}