Eitan Yaakobi

According to our database1, Eitan Yaakobi authored at least 160 papers between 2009 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
PIR Codes with Short Block Length.
Des. Codes Cryptogr., 2021

Function-Correcting Codes.
CoRR, 2021

Multiple Criss-Cross Deletion-Correcting Codes.
CoRR, 2021

The Zero Cubes Free and Cubes Unique Multidimensional Constraints.
CoRR, 2021

Correctable Erasure Patterns in Product Topologies.
CoRR, 2021

Almost Optimal Construction of Functional Batch Codes Using Hadamard Codes.
CoRR, 2021

2020
Bounds on the Length of Functional PIR and Batch Codes.
IEEE Trans. Inf. Theory, 2020

Double and Triple Node-Erasure-Correcting Codes Over Complete Graphs.
IEEE Trans. Inf. Theory, 2020

Private Information Retrieval in Graph-Based Replication Systems.
IEEE Trans. Inf. Theory, 2020

Coding Over Sets for DNA Storage.
IEEE Trans. Inf. Theory, 2020

Multi-Erasure Locally Recoverable Codes Over Small Fields: A Tensor Product Approach.
IEEE Trans. Inf. Theory, 2020

Bounds and Constructions of Codes Over Symbol-Pair Read Channels.
IEEE Trans. Inf. Theory, 2020

Explicit and Efficient WOM Codes of Finite Length.
IEEE Trans. Inf. Theory, 2020

Partial MDS Codes with Regeneration.
CoRR, 2020

Lifted Multiplicity Codes.
CoRR, 2020

Multi-Server Weakly-Private Information Retrieval.
CoRR, 2020

Constrained de Bruijn Codes: Properties, Enumeration, Constructions, and Applications.
CoRR, 2020

Criss-Cross Deletion Correcting Codes.
CoRR, 2020

Optimal Reconstruction Codes for Deletion Channels.
CoRR, 2020

The Error Probability of Maximum-Likelihood Decoding over Two Deletion Channels.
CoRR, 2020

Codes over Trees.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Single-Deletion Single-Substitution Correcting Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

The Error Probability of Maximum-Likelihood Decoding over Two Deletion/Insertion Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Array Codes for Functional PIR and Batch Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Reconstruction of Strings from their Substrings Spectrum.
Proceedings of the IEEE International Symposium on Information Theory, 2020

The Capacity of Single-Server Weakly-Private Information Retrieval.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Coding for Efficient DNA Synthesis.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Coding for Sequence Reconstruction for Single Edits.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Partial MDS Codes with Local Regeneration.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Locally Balanced Constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Achieving the Capacity of the DNA Storage Channel.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

2019
Codes for Graph Erasures.
IEEE Trans. Inf. Theory, 2019

On the Uncertainty of Information Retrieval in Associative Memories.
IEEE Trans. Inf. Theory, 2019

Rank-Modulation Codes for DNA Storage With Shotgun Sequencing.
IEEE Trans. Inf. Theory, 2019

Mutually Uncorrelated Codes for DNA Storage.
IEEE Trans. Inf. Theory, 2019

Reconstruction of Sequences Over Non-Identical Channels.
IEEE Trans. Inf. Theory, 2019

Constructions of Partial MDS Codes Over Small Fields.
IEEE Trans. Inf. Theory, 2019

Nearly Optimal Constructions of PIR and Batch Codes.
IEEE Trans. Inf. Theory, 2019

Covering Codes for Insertions and Deletions.
Electron. Colloquium Comput. Complex., 2019

Duplication-correcting codes.
Des. Codes Cryptogr., 2019

Private Proximity Retrieval Codes.
CoRR, 2019

An Upper Bound on the Capacity of the DNA Storage Channel.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Iterative Programming of Noisy Memory Cells.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Endurance-Limited Memories with Informed Decoder.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

On the Access Complexity of PIR Schemes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Double and Triple Node-Erasure-Correcting Codes over Graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Reconstruction of Sequences in DNA Storage.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Clustering-Correcting Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Weakly-Private Information Retrieval.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Anchor-Based Correction of Substitutions in Indexed Sets.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Private Proximity Retrieval.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Repeat-Free Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Coding for Write ℓ-step-up Memories.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Constrained de Bruijn Codes and their Applications.
Proceedings of the IEEE International Symposium on Information Theory, 2019

On the Number of Distinct k-Decks: Enumeration and Bounds.
Proceedings of the 19th International Symposium on Communications and Information Technologies, 2019

2018
An Analysis of Flash Page Reuse With WOM Codes.
ACM Trans. Storage, 2018

Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction.
IEEE Trans. Inf. Theory, 2018

Sequence Reconstruction Over the Deletion Channel.
IEEE Trans. Inf. Theory, 2018

Coding for Racetrack Memories.
IEEE Trans. Inf. Theory, 2018

Consecutive Switch Codes.
IEEE Trans. Inf. Theory, 2018

Concurrent use of write-once memory.
J. Parallel Distributed Comput., 2018

Multiset combinatorial batch codes.
Des. Codes Cryptogr., 2018

Coding for locality in reconstructing permutations.
Des. Codes Cryptogr., 2018

How to Best Share a Big Secret.
Proceedings of the 11th ACM International Systems and Storage Conference, 2018

Reconstruction from Deletions in Racetrack Memories.
Proceedings of the IEEE Information Theory Workshop, 2018

Codes for Endurance-Limited Memories.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Codes Correcting Limited-Shift Errors in Racetrack Memories.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Ladder Codes: A Class of Error-Correcting Codes with Multi-Level Shared Redundancy.
Proceedings of the 2018 IEEE International Conference on Communications, 2018

A Case for Biased Programming in Flash.
Proceedings of the 10th USENIX Workshop on Hot Topics in Storage and File Systems, 2018

2017
Codes Correcting a Burst of Deletions or Insertions.
IEEE Trans. Inf. Theory, 2017

Coding for the ℓ<sub>∞</sub>-Limited Permutation Channel.
IEEE Trans. Inf. Theory, 2017

On the Capacity of Write-Once Memories.
IEEE Trans. Inf. Theory, 2017

Bounds on Codes Correcting Tandem and Palindromic Duplications.
CoRR, 2017

Multi-Erasure Locally Recoverable Codes Over Small Fields For Flash Memory Array.
CoRR, 2017

Codes for erasures over directed graphs.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Codes correcting position errors in racetrack memories.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Rank modulation codes for DNA storage.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Non-linear cyclic codes that attain the Gilbert-Varshamov bound.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Explicit constructions of finite-length WOM codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Multi-erasure locally recoverable codes over small fields.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Constructions and Decoding of Cyclic Codes Over b-Symbol Read Channels.
IEEE Trans. Inf. Theory, 2016

Codes for Partially Stuck-At Memory Cells.
IEEE Trans. Inf. Theory, 2016

Binary Linear Locally Repairable Codes.
IEEE Trans. Inf. Theory, 2016

Codes Correcting Erasures and Deletions for Rank Modulation.
IEEE Trans. Inf. Theory, 2016

Information-Theoretic Sneak-Path Mitigation in Memristor Crossbar Arrays.
IEEE Trans. Inf. Theory, 2016

Systematic Error-Correcting Codes for Permutations and Multi-Permutations.
IEEE Trans. Inf. Theory, 2016

On the Capacity of Constrained Permutation Codes for Rank Modulation.
IEEE Trans. Inf. Theory, 2016

Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols.
IEEE Trans. Inf. Theory, 2016

Construction of Random Input-Output Codes With Moderate Block Lengths.
IEEE Trans. Commun., 2016

Performance of Multilevel Flash Memories With Different Binary Labelings: A Multi-User Perspective.
IEEE J. Sel. Areas Commun., 2016

Approximate sorting of data streams with limited storage.
J. Comb. Optim., 2016

Bounds and constructions of codes with multiple localities.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Constructions of batch codes with near-optimal redundancy.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Performance of flash memories with different binary labelings: A multi-user perspective.
Proceedings of the IEEE International Symposium on Information Theory, 2016

On the capacity of non-binary write-once memory.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Codes in the damerau distance for DNA storage.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Write sneak-path constraints avoiding disturbs in memristor crossbar arrays.
Proceedings of the IEEE International Symposium on Information Theory, 2016

The Devil Is in the Details: Implementing Flash Page Reuse with WOM Codes.
Proceedings of the 14th USENIX Conference on File and Storage Technologies, 2016

2015
Rank-Modulation Rewrite Coding for Flash Memories.
IEEE Trans. Inf. Theory, 2015

Correcting Grain-Errors in Magnetic Media.
IEEE Trans. Inf. Theory, 2015

Generalized Sphere Packing Bound.
IEEE Trans. Inf. Theory, 2015

PIR with Low Storage Overhead: Coding instead of Replication.
CoRR, 2015

Optimal linear and cyclic locally repairable codes over small fields.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Codes for RAID solutions based upon SSDs.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Cyclic linear binary locally repairable codes.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

WOM codes with uninformed encoder.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

When do WOM codes improve the erasure factor in flash memories?
Proceedings of the IEEE International Symposium on Information Theory, 2015

Coding for the ℓ∞-limited permutation channel.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Linear locally repairable codes with availability.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Codes for distributed PIR with low storage overhead.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Coding schemes for inter-cell interference in flash memory.
Proceedings of the IEEE International Symposium on Information Theory, 2015

It's Not Where Your Data Is, It's How It Got There.
Proceedings of the 7th USENIX Workshop on Hot Topics in Storage and File Systems, 2015

Write Once, Get 50% Free: Saving SSD Erase Costs Using WOM Codes.
Proceedings of the 13th USENIX Conference on File and Storage Technologies, 2015

Masking trapped charge in flash memories.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
High Sum-Rate Three-Write and Nonbinary WOM Codes.
IEEE Trans. Inf. Theory, 2014

Rewriting Codes for Flash Memories.
IEEE Trans. Inf. Theory, 2014

Optimized Cell Programming for Flash Memories With Quantizers.
IEEE Trans. Inf. Theory, 2014

Short \(Q\) -Ary Fixed-Rate WOM Codes for Guaranteed Rewrites and With Hot/Cold Write Differentiation.
IEEE Trans. Inf. Theory, 2014

Logic operations in memory using a memristive Akers array.
Microelectron. J., 2014

Constrained Codes that Mitigate Inter-Cell Interference in Read/Write Cycles for Flash Memories.
IEEE J. Sel. Areas Commun., 2014

Construction of Partial MDS (PMDS) and Sector-Disk (SD) Codes with Two Global Parity Symbols.
CoRR, 2014

Single-deletion-correcting codes over permutations.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Codes correcting erasures and deletions for rank modulation.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Generalized sphere packing bound: Applications.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Generalized sphere packing bound: Basic principles.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Systematic codes for rank modulation.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Constrained codes for rank modulation.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Partial MDS (PMDS) and Sector-Disk (SD) codes that tolerate the erasure of two random sectors.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Time-Space Constrained Codes for Phase-Change Memories.
IEEE Trans. Inf. Theory, 2013

Graded Bit-Error-Correcting Codes With Applications to Flash Memory.
IEEE Trans. Inf. Theory, 2013

Coding for the Lee and Manhattan Metrics With Weighing Matrices.
IEEE Trans. Inf. Theory, 2013

Sequence reconstruction for Grassmann graphs and permutations.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Information-theoretic study of voting systems.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

In-memory computing of Akers logic array.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Building consensus via iterative voting.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Rank-modulation rewriting codes for flash memories.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Sneak-path constraints in memristor crossbar arrays.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Error-correcting codes for multipermutations.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Multiple Error-Correcting WOM-Codes.
IEEE Trans. Inf. Theory, 2012

Codes for Write-Once Memories.
IEEE Trans. Inf. Theory, 2012

High sum-rate three-write and non-binary WOM codes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Decoding of cyclic codes over symbol-pair read channels.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

WOM with retained messages.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Tackling intracell variability in TLC Flash through tensor product codes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Short q-ary WOM codes with hot/cold write differentiation.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Characterization and error-correcting codes for TLC flash memories.
Proceedings of the International Conference on Computing, Networking and Communications, 2012

WOM codes reduce write amplification in NAND flash memory.
Proceedings of the 2012 IEEE Global Communications Conference, 2012

2011
Coding for flash memories.
PhD thesis, 2011

Non-binary WOM-codes for multilevel flash memories.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

On codes that correct asymmetric errors with graded magnitude distribution.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Storage coding for wear leveling in flash memories.
IEEE Trans. Inf. Theory, 2010

Efficient two-write WOM-codes.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

On the parallel programming of flash memory cells.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Dense error-correcting codes in the Lee metric.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

High dimensional error-correcting codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Error-Correction of Multidimensional Bursts.
IEEE Trans. Inf. Theory, 2009

Multidimensional Flash Codes
CoRR, 2009

Characterizing flash memory: anomalies, observations, and applications.
Proceedings of the 42st Annual IEEE/ACM International Symposium on Microarchitecture (MICRO-42 2009), 2009

A nearly optimal construction of flash codes.
Proceedings of the IEEE International Symposium on Information Theory, 2009


  Loading...