206 citations · 239 across the 40 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.IT2016
Asymptotically Optimal Regenerating Codes Over Any Field
Netanel Raviv
The study of regenerating codes has advanced tremendously in recent years. However, most known constructions require large field size, and hence may be hard to implement in practic…
cs.IT2016
Coding for Locality in Reconstructing Permutations
Netanel Raviv, Eitan Yaakobi, Muriel Medard
The problem of storing permutations in a distributed manner arises in several common scenarios, such as efficient updates of a large, encrypted, or compressed data set. This proble…