• Publications
  • Influence
Characterizing flash memory: Anomalies, observations, and applications
TLDR
We have empirically characterized flash memory technology from five manufacturers by directly measuring the performance, power, and reliability of flash memory. Expand
  • 446
  • 38
  • PDF
A nearly optimal construction of flash codes
TLDR
In this paper, we present a new construction of flash codes that approaches this lower bound to within a factor logarithmic in k. Expand
  • 58
  • 11
  • PDF
Binary Linear Locally Repairable Codes
TLDR
We present an upper bound on the minimum distance d of linear LRCs with availability, based on the work of Cadambe and Mazumdar. Expand
  • 53
  • 9
  • PDF
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
PIR with Low Storage Overhead: Coding instead of Replication
TLDR
We show that information-theoretic PIR can be achieved with storage overhead arbitrarily close to the optimal value of $1$, without sacrificing the communication complexity. Expand
  • 60
  • 8
  • PDF
Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols
TLDR
We present a general construction that addresses the case of any number of failed disks and in addition, two erased sectors. Expand
  • 38
  • 7
  • PDF
Constructions of batch codes with near-optimal redundancy
TLDR
Batch codes, first studied by Ishai et al., are a coding scheme to encode n information bits into m buckets, in a way that every batch request of k bits can be decoded while at most one bit is read from each bucket. Expand
  • 22
  • 7
  • PDF
Short \(Q\) -Ary Fixed-Rate WOM Codes for Guaranteed Rewrites and With Hot/Cold Write Differentiation
TLDR
We introduce a new rewrite model where some of the input bits can be updated multiple times in a write sequence (hot bits), while other are updated at most once (cold bits). Expand
  • 20
  • 5
  • PDF
Generalized Sphere Packing Bound
TLDR
We present a generalization of the sphere packing bound, based upon a recent work by Kulkarni and Kiyavash for deriving upper bounds on the cardinality of deletion-correcting codes. Expand
  • 26
  • 5
  • PDF
Nearly optimal constructions of PIR and batch codes
  • Hilal Asi, Eitan Yaakobi
  • Mathematics, Computer Science
  • IEEE International Symposium on Information…
  • 25 January 2017
TLDR
In this work we study two families of codes with availability, namely private information retrieval (FIR) codes and batch codes. Expand
  • 26
  • 5
  • PDF