Coding for locality in reconstructing permutations

Netanel Raviv, Eitan Yaakobi, Muriel Medard

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationProceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
Number of pages5
ISBN (Electronic)9781509018062
StatePublished - 10 Aug 2016
Event2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain
Duration: 10 Jul 201615 Jul 2016

Publication series

NameIEEE International Symposium on Information Theory - Proceedings


Conference2016 IEEE International Symposium on Information Theory, ISIT 2016


  • Distributed storage
  • Reed-Solomon codes
  • locality
  • multi-permutations
  • permutation codes
  • permutation polynomials

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics


Dive into the research topics of 'Coding for locality in reconstructing permutations'. Together they form a unique fingerprint.

Cite this