Eitan Yaakobi

IEEE Trans. Inf. Theory, May, 2024

Sequence Design and Reconstruction Under the Repeat Channel in Enzymatic DNA Synthesis.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2024

One Code Fits All: Strong stuck-at codes for versatile memory encoding.

[BibT_eX]

[DOI]

Roni Con

CoRR, 2024

Permutation Recovery Problem against Deletion Errors for DNA Data Storage.

[BibT_eX]

[DOI]

CoRR, 2024

An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes.

[BibT_eX]

[DOI]

CoRR, 2024

Tail-Erasure-Correcting Codes.

[BibT_eX]

[DOI]

Boaz Moav

CoRR, 2024

Covering All Bases: The Next Inning in DNA Sequencing Efficiency.

[BibT_eX]

[DOI]

Hadas Abraham

CoRR, 2024

Interactive Byzantine-Resilient Gradient Coding for General Data Assignments.

[BibT_eX]

[DOI]

CoRR, 2024

Correcting a Single Deletion in Reads from a Nanopore Sequencer.

[BibT_eX]

[DOI]

CoRR, 2024

Achieving DNA Labeling Capacity with Minimum Labels through Extremal de Bruijn Subgraphs.

[BibT_eX]

[DOI]

CoRR, 2024

Reducing Coverage Depth in DNA Storage: A Combinatorial Perspective on Random Access Efficiency.

[BibT_eX]

[DOI]

CoRR, 2024

Error-Correcting Codes for Combinatorial DNA Composite.

[BibT_eX]

[DOI]

CoRR, 2024

The Capacity of the Weighted Read Channel.

[BibT_eX]

[DOI]

Omer Yerushalmi

CoRR, 2024

Byzantine-Resilient Gradient Coding through Local Gradient Computations.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Single-Deletion Single-Substitution Correcting Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, December, 2023

Invertible Bloom Lookup Tables with Listing Guarantees.

[BibT_eX]

[DOI]

Proc. ACM Meas. Anal. Comput. Syst., December, 2023

The Zero Cubes Free and Cubes Unique Multidimensional Constraints.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, October, 2023

Adversarial Torn-Paper Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, October, 2023

Design of optimal labeling patterns for optical genome mapping via information theory.

[BibT_eX]

[DOI]

Bioinform., October, 2023

Generalized Unique Reconstruction From Substrings.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, September, 2023

Function-Correcting Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, September, 2023

Insertion and Deletion Correction in Polymer-Based Data Storage.

[BibT_eX]

[DOI]

Anisha Banerjee

IEEE Trans. Inf. Theory, July, 2023

On Hierarchies of Balanced Sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, May, 2023

The Noisy Drawing Channel: Reliable Data Storage in DNA Sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, May, 2023

On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, April, 2023

Private Information Retrieval Without Storage Overhead: Coding Instead of Replication.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2023

Dimensions of Channel Coding: From Theory to Algorithms to Applications.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2023

Bee Identification Problem for DNA Strands.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2023

Transverse-Read-Codes for Domain Wall Memories.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2023

M-DAB: An Input-Distribution Optimization Algorithm for Composite DNA Storage by the Multinomial Channel.

[BibT_eX]

[DOI]

Adir Kobovich

Nir Weinberger

CoRR, 2023

Storage codes and recoverable systems on lines and grids.

[BibT_eX]

[DOI]

CoRR, 2023

Universal Framework for Parametric Constrained Coding.

[BibT_eX]

[DOI]

CoRR, 2023

On the number of distinct <i>k</i>-decks: Enumeration and bounds.

[BibT_eX]

[DOI]

Johan Chrisnata

Sankeerth Rao Karingula

Hanwen Yao

Adv. Math. Commun., 2023

DNA Synthesis Using Shortmers.

[BibT_eX]

[DOI]

Andreas Lenz

Proceedings of the IEEE International Symposium on Information Theory, 2023

Data-Driven Bee Identification for DNA Strands.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Trading Communication for Computation in Byzantine-Resilient Gradient Coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

On the Capacity of DNA Labeling.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Thermal-Aware Channel Capacity.

[BibT_eX]

[DOI]

Yeow Meng Chee

Kees A. Schouhamer Immink

Proceedings of the IEEE International Symposium on Information Theory, 2023

DNA-Correcting Codes: End-to-end Correction in DNA Storage Systems.

[BibT_eX]

[DOI]

Avital Boruchovsky

Proceedings of the IEEE International Symposium on Information Theory, 2023

Cover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage Systems.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Coding for IBLTs with Listing Guarantees.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Error-Correcting Codes for Nanopore Sequencing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Almost Optimal Construction of Functional Batch Codes Using Extended Simplex Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Multiple Criss-Cross Insertion and Deletion Correcting Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Clustering-Correcting Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Array Codes for Functional PIR and Batch Codes.

[BibT_eX]

[DOI]

Mohammad Nassar

IEEE Trans. Inf. Theory, 2022

Multi-Server Weakly-Private Information Retrieval.

[BibT_eX]

[DOI]

Hsuan-Yin Lin

Siddhartha Kumar

Eirik Rosnes

Alexandre Graell i Amat

IEEE Trans. Inf. Theory, 2022

Correcting Deletions With Multiple Reads.

[BibT_eX]

[DOI]

Johan Chrisnata

IEEE Trans. Inf. Theory, 2022

Endurance-Limited Memories: Capacity and Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Coding for Sequence Reconstruction for Single Edits.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Iterative Programming of Noisy Memory Cells.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2022

Reconstruction from Substrings with Partial Overlap.

[BibT_eX]

[DOI]

CoRR, 2022

Codes for Constrained Periodicity.

[BibT_eX]

[DOI]

CoRR, 2022

The Input and Output Entropies of the k-Deletion/Insertion Channel.

[BibT_eX]

[DOI]

CoRR, 2022

On The Decoding Error Weight of One or Two Deletion Channels.

[BibT_eX]

[DOI]

CoRR, 2022

The Input and Output Entropies of the k-Deletion/Insertion Channel with Small Radii.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2022

Equivalence of Insertion/Deletion Correcting Codes for d-dimensional Arrays.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Information Theoretic Private Inference in Quantized Models.

[BibT_eX]

[DOI]

Rawad Bitar

Proceedings of the IEEE International Symposium on Information Theory, 2022

Covering Sequences for ℓ-Tuples.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Recoverable systems on lines and grids.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Private Proximity Retrieval Codes.

[BibT_eX]

[DOI]

Yiwei Zhang

IEEE Trans. Inf. Theory, 2021

Codes Over Trees.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

On Levenshtein's Reconstruction Problem Under Insertions, Deletions, and Substitutions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Reconstruction of Strings From Their Substrings Spectrum.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Covering Codes Using Insertions or Deletions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Partial MDS Codes With Regeneration.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Lifted Reed-Solomon Codes and Lifted Multiplicity Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Repeat-Free Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Criss-Cross Insertion and Deletion Correcting Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

The Capacity of Single-Server Weakly-Private Information Retrieval.

[BibT_eX]

[DOI]

Hsuan-Yin Lin

Siddhartha Kumar

Eirik Rosnes

Alexandre Graell i Amat

IEEE J. Sel. Areas Inf. Theory, 2021

PIR Codes with Short Block Length.

[BibT_eX]

[DOI]

Sascha Kurz

Des. Codes Cryptogr., 2021

Deep DNA Storage: Scalable and Robust DNA Storage via Coding Theory and Deep Learning.

[BibT_eX]

[DOI]

CoRR, 2021

On the Size of Levenshtein Balls.

[BibT_eX]

[DOI]

CoRR, 2021

SOLQC: Synthetic Oligo Library Quality Control tool.

[BibT_eX]

[DOI]

Bioinform., 2021

On the Capacity of DNA-based Data Storage under Substitution Errors.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Visual Communications and Image Processing, 2021

Multi-strand Reconstruction from Substrings.

[BibT_eX]

[DOI]

Yonatan Yehezkeally

Proceedings of the IEEE Information Theory Workshop, 2021

Sequence Reconstruction Under Stutter Noise in Enzymatic DNA Synthesis.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2021

The Intersection of Insertion and Deletion Balls.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2021

Almost Optimal Construction of Functional Batch Codes Using Hadamard Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Multiple Criss-Cross Deletion-Correcting Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

On List Decoding of Insertions and Deletions under the Reconstruction Model.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Balanced de Bruijn Sequences.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Correctable Erasure Patterns in Product Topologies.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Coding for Transverse-Reads in Domain Wall Memories.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Decoding for Optimal Expected Normalized Distance over the t-Deletion Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

On Levenshtein Balls with Radius One.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Bounds on the Length of Functional PIR and Batch Codes.

[BibT_eX]

[DOI]

Yiwei Zhang

IEEE Trans. Inf. Theory, 2020

Double and Triple Node-Erasure-Correcting Codes Over Complete Graphs.

[BibT_eX]

[DOI]

Yuval Efron

IEEE Trans. Inf. Theory, 2020

Private Information Retrieval in Graph-Based Replication Systems.

[BibT_eX]

[DOI]

Itzhak Tamo

IEEE Trans. Inf. Theory, 2020

Coding Over Sets for DNA Storage.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Multi-Erasure Locally Recoverable Codes Over Small Fields: A Tensor Product Approach.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Bounds and Constructions of Codes Over Symbol-Pair Read Channels.

[BibT_eX]

[DOI]

Ohad Elishco

IEEE Trans. Inf. Theory, 2020

Explicit and Efficient WOM Codes of Finite Length.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

Omer Sabary

Alexander Yucovich

CoRR, 2020

On Lifted Multiplicity Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

Segmented Reverse Concatenation: A New Approach to Constrained ECC.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Optimal Reconstruction Codes for Deletion Channels.

[BibT_eX]

[DOI]

Johan Chrisnata

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Criss-Cross Deletion Correcting Codes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

The Error Probability of Maximum-Likelihood Decoding over Two Deletion/Insertion Channels.

[BibT_eX]

[DOI]

Omer Sabary

Alexander Yucovich

Proceedings of the IEEE International Symposium on Information Theory, 2020

Coding for Efficient DNA Synthesis.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Coding for Sequence Reconstruction for Single Edits.

[BibT_eX]

[DOI]

Tuan Thanh Nguyen

Proceedings of the IEEE International Symposium on Information Theory, 2020

Partial MDS Codes with Local Regeneration.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Locally Balanced Constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Achieving the Capacity of the DNA Storage Channel.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

2019

Codes for Graph Erasures.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

On the Uncertainty of Information Retrieval in Associative Memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Rank-Modulation Codes for DNA Storage With Shotgun Sequencing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Mutually Uncorrelated Codes for DNA Storage.

[BibT_eX]

[DOI]

Maya Levy

IEEE Trans. Inf. Theory, 2019

Reconstruction of Sequences Over Non-Identical Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Constructions of Partial MDS Codes Over Small Fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Nearly Optimal Constructions of PIR and Batch Codes.

[BibT_eX]

[DOI]

Hilal Asi

IEEE Trans. Inf. Theory, 2019

Covering Codes for Insertions and Deletions.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2019

Duplication-correcting codes.

[BibT_eX]

[DOI]

Andreas Lenz

Des. Codes Cryptogr., 2019

An Upper Bound on the Capacity of the DNA Storage Channel.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Endurance-Limited Memories with Informed Decoder.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

On the Access Complexity of PIR Schemes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Double and Triple Node-Erasure-Correcting Codes over Graphs.

[BibT_eX]

[DOI]

Yuval Efron

Proceedings of the IEEE International Symposium on Information Theory, 2019

Reconstruction of Sequences in DNA Storage.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Weakly-Private Information Retrieval.

[BibT_eX]

[DOI]

Hsuan-Yin Lin

Siddhartha Kumar

Eirik Rosnes

Alexandre Graell i Amat

Proceedings of the IEEE International Symposium on Information Theory, 2019

Anchor-Based Correction of Substitutions in Indexed Sets.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Private Proximity Retrieval.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Coding for Write ℓ-step-up Memories.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Constrained de Bruijn Codes and their Applications.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

On the Number of Distinct k-Decks: Enumeration and Bounds.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Communications and Information Technologies, 2019

2018

An Analysis of Flash Page Reuse With WOM Codes.

[BibT_eX]

[DOI]

ACM Trans. Storage, 2018

Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction.

[BibT_eX]

[DOI]

Olgica Milenkovic

IEEE Trans. Inf. Theory, 2018

Sequence Reconstruction Over the Deletion Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Coding for Racetrack Memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Consecutive Switch Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Concurrent use of write-once memory.

[BibT_eX]

[DOI]

James Aspnes

Keren Censor-Hillel

J. Parallel Distributed Comput., 2018

Multiset combinatorial batch codes.

[BibT_eX]

[DOI]

Hui Zhang

Natalia Silberstein

Des. Codes Cryptogr., 2018

Coding for locality in reconstructing permutations.

[BibT_eX]

[DOI]

Muriel Médard

Des. Codes Cryptogr., 2018

How to Best Share a Big Secret.

[BibT_eX]

[DOI]

Proceedings of the 11th ACM International Systems and Storage Conference, 2018

Reconstruction from Deletions in Racetrack Memories.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

Codes for Endurance-Limited Memories.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Codes Correcting Limited-Shift Errors in Racetrack Memories.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Ladder Codes: A Class of Error-Correcting Codes with Multi-Level Shared Redundancy.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Conference on Communications, 2018

A Case for Biased Programming in Flash.

[BibT_eX]

[DOI]

Proceedings of the 10th USENIX Workshop on Hot Topics in Storage and File Systems, 2018

2017

Codes Correcting a Burst of Deletions or Insertions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Coding for the ℓ<sub>∞</sub>-Limited Permutation Channel.

[BibT_eX]

[DOI]

Michael Langberg

IEEE Trans. Inf. Theory, 2017

On the Capacity of Write-Once Memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Bounds on Codes Correcting Tandem and Palindromic Duplications.

[BibT_eX]

[DOI]

Andreas Lenz

CoRR, 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

Codes for erasures over directed graphs.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Codes correcting position errors in racetrack memories.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Rank modulation codes for DNA storage.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Non-linear cyclic codes that attain the Gilbert-Varshamov bound.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Explicit constructions of finite-length WOM codes.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Multi-erasure locally recoverable codes over small fields.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016

Constructions and Decoding of Cyclic Codes Over b-Symbol Read Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Codes for Partially Stuck-At Memory Cells.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Binary Linear Locally Repairable Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Codes Correcting Erasures and Deletions for Rank Modulation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Information-Theoretic Sneak-Path Mitigation in Memristor Crossbar Arrays.

[BibT_eX]

[DOI]

Shahar Kvatinsky

IEEE Trans. Inf. Theory, 2016

Systematic Error-Correcting Codes for Permutations and Multi-Permutations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

On the Capacity of Constrained Permutation Codes for Rank Modulation.

[BibT_eX]

[DOI]

Sarit Buzaglo

IEEE Trans. Inf. Theory, 2016

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

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Construction of Random Input-Output Codes With Moderate Block Lengths.

[BibT_eX]

[DOI]

Ravi Motwani

IEEE Trans. Commun., 2016

Performance of Multilevel Flash Memories With Different Binary Labelings: A Multi-User Perspective.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2016

Approximate sorting of data streams with limited storage.

[BibT_eX]

[DOI]

Farzad Farnoud

J. Comb. Optim., 2016

Bounds and constructions of codes with multiple localities.

[BibT_eX]

[DOI]

Alexander Zeh

Proceedings of the IEEE International Symposium on Information Theory, 2016

Constructions of batch codes with near-optimal redundancy.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Performance of flash memories with different binary labelings: A multi-user perspective.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

On the capacity of non-binary write-once memory.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Codes in the damerau distance for DNA storage.

[BibT_eX]

[DOI]

Olgica Milenkovic

Proceedings of the IEEE International Symposium on Information Theory, 2016

Write sneak-path constraints avoiding disturbs in memristor crossbar arrays.

[BibT_eX]

[DOI]

Shahar Kvatinsky

Proceedings of the IEEE International Symposium on Information Theory, 2016

The Devil Is in the Details: Implementing Flash Page Reuse with WOM Codes.

[BibT_eX]

[DOI]

Proceedings of the 14th USENIX Conference on File and Storage Technologies, 2016

2015

Rank-Modulation Rewrite Coding for Flash Memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Correcting Grain-Errors in Magnetic Media.

[BibT_eX]

[DOI]

Lara Dolecek

IEEE Trans. Inf. Theory, 2015

Generalized Sphere Packing Bound.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

PIR with Low Storage Overhead: Coding instead of Replication.

[BibT_eX]

[DOI]

CoRR, 2015

Optimal linear and cyclic locally repairable codes over small fields.

[BibT_eX]

[DOI]

Alexander Zeh

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Codes for RAID solutions based upon SSDs.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Cyclic linear binary locally repairable codes.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

WOM codes with uninformed encoder.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

When do WOM codes improve the erasure factor in flash memories?

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Coding for the ℓ∞-limited permutation channel.

[BibT_eX]

[DOI]

Michael Langberg

Proceedings of the IEEE International Symposium on Information Theory, 2015

Linear locally repairable codes with availability.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Codes for distributed PIR with low storage overhead.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Coding schemes for inter-cell interference in flash memory.

[BibT_eX]

[DOI]

Sarit Buzaglo

Proceedings of the IEEE International Symposium on Information Theory, 2015

It's Not Where Your Data Is, It's How It Got There.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Gala Yadgar

Assaf Schuster

Proceedings of the 13th USENIX Conference on File and Storage Technologies, 2015

Masking trapped charge in flash memories.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014

High Sum-Rate Three-Write and Nonbinary WOM Codes.

[BibT_eX]

[DOI]

Amir Shpilka

IEEE Trans. Inf. Theory, 2014

Rewriting Codes for Flash Memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Optimized Cell Programming for Flash Memories With Quantizers.

[BibT_eX]

[DOI]

Minghai Qin

IEEE Trans. Inf. Theory, 2014

Short \(Q\) -Ary Fixed-Rate WOM Codes for Guaranteed Rewrites and With Hot/Cold Write Differentiation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Logic operations in memory using a memristive Akers array.

[BibT_eX]

[DOI]

Microelectron. J., 2014

Constrained Codes that Mitigate Inter-Cell Interference in Read/Write Cycles for Flash Memories.

[BibT_eX]

[DOI]

Minghai Qin

IEEE J. Sel. Areas Commun., 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Single-deletion-correcting codes over permutations.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Codes correcting erasures and deletions for rank modulation.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Generalized sphere packing bound: Applications.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Generalized sphere packing bound: Basic principles.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Systematic codes for rank modulation.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Constrained codes for rank modulation.

[BibT_eX]

[DOI]

Sarit Buzaglo

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Minghai Qin

IEEE Trans. Inf. Theory, 2013

Graded Bit-Error-Correcting Codes With Applications to Flash Memory.

[BibT_eX]

[DOI]

Lara Dolecek

IEEE Trans. Inf. Theory, 2013

Coding for the Lee and Manhattan Metrics With Weighing Matrices.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Sequence reconstruction for Grassmann graphs and permutations.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Information-theoretic study of voting systems.

[BibT_eX]

[DOI]

Michael Langberg

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

In-memory computing of Akers logic array.

[BibT_eX]

[DOI]

Anxiao Andrew Jiang

Farzad Farnoud Hassanzadeh

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Building consensus via iterative voting.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Rank-modulation rewriting codes for flash memories.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Sneak-path constraints in memristor crossbar arrays.

[BibT_eX]

[DOI]

Shahar Kvatinsky

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Error-correcting codes for multipermutations.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Multiple Error-Correcting WOM-Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Codes for Write-Once Memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

High sum-rate three-write and non-binary WOM codes.

[BibT_eX]

[DOI]

Amir Shpilka

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Decoding of cyclic codes over symbol-pair read channels.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

WOM with retained messages.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Tackling intracell variability in TLC Flash through tensor product codes.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Short q-ary WOM codes with hot/cold write differentiation.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Characterization and error-correcting codes for TLC flash memories.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computing, Networking and Communications, 2012

WOM codes reduce write amplification in NAND flash memory.

[BibT_eX]

[DOI]

Luojie Xiang

Brian M. Kurkoski

Proceedings of the 2012 IEEE Global Communications Conference, 2012

2011

Coding for flash memories.

[BibT_eX]

[DOI]

PhD thesis, 2011

Non-binary WOM-codes for multilevel flash memories.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

On codes that correct asymmetric errors with graded magnitude distribution.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Storage coding for wear leveling in flash memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Efficient two-write WOM-codes.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

On the parallel programming of flash memory cells.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Dense error-correcting codes in the Lee metric.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

High dimensional error-correcting codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Multiple-write WOM-codes.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009

Error-Correction of Multidimensional Bursts.

[BibT_eX]

[DOI]