Coding for locality in reconstructing permutations
From MaRDI portal
Publication:1696052
DOI10.1007/s10623-017-0378-9zbMath1386.68050arXiv1601.04504OpenAlexW2733797194MaRDI QIDQ1696052
Netanel Raviv, Eitan Yaakobi, Muriel Médard
Publication date: 14 February 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.04504
Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Linear codes (general theory) (94B05) Information storage and retrieval of data (68P20) Distributed systems (68M14)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Succinct representations of permutations and functions
- The number of transversals in a Latin square
- Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
- Coding for locality in reconstructing permutations
- Additive triples of bijections, or the toroidal semiqueens problem
- Constructions for permutation codes in powerline communications
- Combinatorics of Permutations
- On the Capacity of Constrained Permutation Codes for Rank Modulation
- Codes Correcting Erasures and Deletions for Rank Modulation
- A Family of Optimal Locally Recoverable Codes
- Error-Correction in Flash Memories via Codes in the Ulam Metric
- Coding with permutations
- Cellular graph automata. I. basic concepts, graph property measurement, closure properties
- Rank Modulation for Flash Memories
- Codes in Permutations and Error Correction for Rank Modulation
- Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
