Eitan Yaakobi

Publications
Influence

Characterizing flash memory: Anomalies, observations, and applications

Laura M. Grupp, A. Caulfield, +4 authors J. Wolf
Computer Science
42nd Annual IEEE/ACM International Symposium on…
12 December 2009

We have empirically characterized flash memory technology from five manufacturers by directly measuring the performance, power, and reliability of flash memory. Expand

A nearly optimal construction of flash codes

Hessam Mahdavifar, P. Siegel, A. Vardy, J. Wolf, Eitan Yaakobi
Mathematics, Computer Science
IEEE International Symposium on Information…
10 May 2009

In this paper, we present a new construction of flash codes that approaches this lower bound to within a factor logarithmic in k. Expand

Binary Linear Locally Repairable Codes

Pengfei Huang, Eitan Yaakobi, H. Uchikawa, P. Siegel
Mathematics, Computer Science
IEEE Transactions on Information Theory
22 November 2015

We present an upper bound on the minimum distance d of linear LRCs with availability, based on the work of Cadambe and Mazumdar. Expand

Codes Correcting a Burst of Deletions or Insertions

Clayton Schoeny, A. Wachter-Zeh, R. Gabrys, Eitan Yaakobi
Mathematics, Computer Science
IEEE Transactions on Information Theory
22 February 2016

This paper studies codes that correct a burst of deletions or insertions. Expand

PIR with Low Storage Overhead: Coding instead of Replication

A. Fazeli, A. Vardy, Eitan Yaakobi
Computer Science, Mathematics
ArXiv
22 May 2015

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

Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols

M. Blaum, J. Plank, M. Schwartz, Eitan Yaakobi
Computer Science
IEEE Transactions on Information Theory
1 May 2016

We present a general construction that addresses the case of any number of failed disks and in addition, two erased sectors. Expand

Constructions of batch codes with near-optimal redundancy

A. Vardy, Eitan Yaakobi
Computer Science
IEEE International Symposium on Information…
10 July 2016

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

Short $Q$ -Ary Fixed-Rate WOM Codes for Guaranteed Rewrites and With Hot/Cold Write Differentiation

Yuval Cassuto, Eitan Yaakobi
Computer Science
IEEE Transactions on Information Theory
1 July 2014

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

Generalized Sphere Packing Bound

A. Fazeli, A. Vardy, Eitan Yaakobi
Mathematics, Computer Science
IEEE Transactions on Information Theory
24 January 2014

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

Nearly optimal constructions of PIR and batch codes

Hilal Asi, Eitan Yaakobi
Mathematics, Computer Science
IEEE International Symposium on Information…
25 January 2017

In this work we study two families of codes with availability, namely private information retrieval (FIR) codes and batch codes. Expand

Recommended Authors