Now showing items 1-3 of 3

    • Coding for locality in reconstructing permutations 

      Raviv, Netanel; Yaakobi, Eitan; Medard, Muriel (Springer US, 2017-07)
      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 ...
    • Coding for locality in reconstructing permutations 

      Raviv, Netanel; Yaakobi, Eitan; Medard, Muriel (Institute of Electrical and Electronics Engineers (IEEE), 2016-08)
      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 ...
    • Repeat-Free Codes 

      Elishco, Ohad; Gabrys, Ryan; Yaakobi, Eitan; Medard, Muriel (Institute of Electrical and Electronics Engineers (IEEE), 2019-07)
      © 2019 IEEE. In this paper we consider the problem of encoding data into repeat-free sequences in which sequences are imposed to contain any k-tuple at most once (for predefined k). First, the capacity and redundancy of ...