• Publications
  • Influence
Codes Correcting a Burst of Deletions or Insertions
TLDR
This paper studies codes that correct a burst of deletions or insertions. Expand
  • 69
  • 8
  • PDF
Portable and Error-Free DNA-Based Data Storage
TLDR
A portable, random access DNA-based data storage system that uses error-prone nanopore sequencers, while still producing error-free readouts with the highest reported information rate/density. Expand
  • 116
  • 4
  • PDF
Constructions of partial MDS codes over small fields
TLDR
Partial MDS (PMDS) codes are a class of erasure-correcting array codes which combine local correction of rows with global correction of the array. Expand
  • 28
  • 4
  • PDF
Codes correcting erasures and deletions for rank modulation
TLDR
Error-correcting codes for permutations have received a considerable attention in the past few years, especially in applications of the rank modulation scheme. Expand
  • 18
  • 4
  • PDF
Optimal Systematic t-Deletion Correcting Codes
TLDR
We propose a systematic t-deletion correcting code construction that achieves 4t log n + o(log n) bits of redundancy, which is asymptotically within a factor of 4 from being optimal. Expand
  • 4
  • 3
Non-binary WOM-codes for multilevel flash memories
TLDR
A Write-Once Memory (WOM)-code is a coding scheme that allows information to be written in a memory block multiple times, but in a way that the stored values are not decreased across writes. Expand
  • 30
  • 2
  • PDF
Coded Trace Reconstruction
TLDR
We study the study of coded trace reconstruction, the design and analysis of high-rate efficiently encodable codes that can be efficiently decoded with high probability from few reads (also called traces) corrupted by edit errors. Expand
  • 29
  • 2
  • PDF
Tackling intracell variability in TLC Flash through tensor product codes
TLDR
We propose a mathematical model that captures the intracell variability, which is manifested by certain patterns of bit-errors. Expand
  • 21
  • 2
  • PDF
Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction
TLDR
We introduce the new problem of code design in the Damerau metric and provide constructions for codes that can simultaneously correct a single deletion and multiple adjacent transpositions. Expand
  • 23
  • 1
  • PDF
Dynamic Threshold Schemes for Multi-Level Non-Volatile Memories
TLDR
We introduce a general scheme to compute and apply dynamic thresholds for multi-level cell (MLC) memories and derive performance bounds. Expand
  • 29
  • 1
  • PDF