Coding for locality in reconstructing permutations
Name
Medard_Coding for locality.pdf
Size
133.95 KB
Format
Adobe PDF
Checksum (MD5)
e129dc2a9b8284f905273838764f7302
Author(s)
Raviv, Netanel
Yaakobi, Eitan
Medard, Muriel
Date Issued
August 2016
Journal
2016 IEEE International Symposium on Information Theory (ISIT)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Raviv, Netanel, Eitan Yaakobi, and Muriel Médard. "Coding for Locality in Reconstructing Permutations." 2016 IEEE International Symposium on Information Theory (ISIT), 10-15 July 2016, Barcelona, Spain, IEEE, 2016, pp. 450–54.
Version
Original manuscript
Abstract
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 problem may be addressed in either a combinatorial or a coding approach. The former approach boils down to presenting large sets of permutations with locality, that is, any symbol of the permutation can be computed from a small set of other symbols. In the latter approach, a permutation may be coded in order to achieve locality. This paper focuses on the combinatorial approach. We provide upper and lower bounds for the maximal size of a set of permutations with locality, and provide several simple constructions which attain the upper bound. In cases where the upper bound is not attained, we provide alternative constructions using Reed-Solomon codes, permutation polynomials, and multi-permutations.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2016.7541339
