Coding for locality in reconstructing permutations
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 se...
Main Authors: | Raviv, Netanel (Author), Yaakobi, Eitan (Author), Medard, Muriel (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Research Laboratory of Electronics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer US,
2018-04-03T17:49:58Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Coding for locality in reconstructing permutations
by: Raviv, Netanel, et al.
Published: (2018) -
Repeat-Free Codes
by: Elishco, Ohad, et al.
Published: (2021) -
Repeat-Free Codes
by: Elishco, Ohad, et al.
Published: (2022) -
Cyclically permutable codes
by: Lundqvist, Anders
Published: (1997) -
Using T-codes as locally decodable source codes
by: Speidel, Ulrich, et al.
Published: (2016)