| Publication | Date of Publication | Type |
|---|
Reed-Solomon codes against insertions and deletions: full-length and rate-1/2 codes
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
Achieving DNA labeling capacity with minimum labels through extremal de Bruijn subgraphs
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
A combinatorial perspective on random access efficiency for DNA storage
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
Exciting coding problems for DNA-based storage systems
Notices of the American Mathematical Society | 2025-12-02 | Paper |
Conditional entropies of \(k\)-deletion/insertion channels
IEEE Transactions on Information Theory | 2025-10-06 | Paper |
Tail-erasure-correcting codes
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Storage codes and recoverable systems on lines and grids
Designs, Codes and Cryptography | 2024-12-11 | Paper |
Error-correcting codes for nanopore sequencing
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
On the intersection of multiple insertion (or deletion) balls and its application to list decoding under the reconstruction model
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
Single-deletion single-substitution correcting codes
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
Function-correcting codes
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
Generalized unique reconstruction from substrings
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
The zero cubes free and cubes unique multidimensional constraints
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
Adversarial torn-paper codes
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
Insertion and deletion correction in polymer-based data storage
IEEE Transactions on Information Theory | 2024-07-18 | Paper |
On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric
IEEE Transactions on Information Theory | 2024-03-19 | Paper |
The Noisy Drawing Channel: Reliable Data Storage in DNA Sequences
IEEE Transactions on Information Theory | 2024-03-19 | Paper |
On Hierarchies of Balanced Sequences
IEEE Transactions on Information Theory | 2024-03-19 | Paper |
Almost Optimal Construction of Functional Batch Codes Using Extended Simplex Codes
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
Correcting Deletions With Multiple Reads
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
| Storage codes and recoverable systems on lines and grids | 2023-08-28 | Paper |
On the number of distinct \(k\)-decks: enumeration and bounds
Advances in Mathematics of Communications | 2023-07-07 | Paper |
| Cover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage Systems | 2023-05-09 | Paper |
Multiple Criss-Cross Insertion and Deletion Correcting Codes
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Clustering-Correcting Codes
IEEE Transactions on Information Theory | 2022-05-30 | Paper |
Endurance-Limited Memories: Capacity and Codes
IEEE Transactions on Information Theory | 2022-05-30 | Paper |
On Levenshtein’s Reconstruction Problem Under Insertions, Deletions, and Substitutions
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Coding for Sequence Reconstruction for Single Edits
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Array Codes for Functional PIR and Batch Codes
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Multi-Server Weakly-Private Information Retrieval
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Criss-Cross Insertion and Deletion Correcting Codes
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Partial MDS Codes With Regeneration
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Private Proximity Retrieval Codes
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Repeat-Free Codes
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
Reconstruction of Strings From Their Substrings Spectrum
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Codes Over Trees
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Covering Codes Using Insertions or Deletions
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
PIR codes with short block length
Designs, Codes and Cryptography | 2021-03-17 | Paper |
PIR codes with short block length
Designs, Codes and Cryptography | 2021-03-17 | Paper |
Explicit and Efficient WOM Codes of Finite Length
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Bounds and Constructions of Codes Over Symbol-Pair Read Channels
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Bounds on the Length of Functional PIR and Batch Codes
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Coding Over Sets for DNA Storage
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Multi-Erasure Locally Recoverable Codes Over Small Fields: A Tensor Product Approach
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Private Information Retrieval in Graph-Based Replication Systems
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Double and Triple Node-Erasure-Correcting Codes Over Complete Graphs
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Codes for Graph Erasures
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Constructions of Partial MDS Codes Over Small Fields
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
On the Uncertainty of Information Retrieval in Associative Memories
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Mutually uncorrelated codes for DNA storage
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Duplication-correcting codes
Designs, Codes and Cryptography | 2019-02-20 | Paper |
Nearly Optimal Constructions of PIR and Batch Codes
IEEE Transactions on Information Theory | 2019-01-28 | Paper |
Reconstruction of Sequences Over Non-Identical Channels
IEEE Transactions on Information Theory | 2019-01-28 | Paper |
Rank-Modulation Codes for DNA Storage With Shotgun Sequencing
IEEE Transactions on Information Theory | 2019-01-18 | Paper |
Coding for Racetrack Memories
IEEE Transactions on Information Theory | 2018-12-04 | Paper |
Multiset combinatorial batch codes
Designs, Codes and Cryptography | 2018-10-10 | Paper |
| scientific article; zbMATH DE number 6900644 (Why is no real title available?) | 2018-07-09 | Paper |
Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Coding for the $\boldsymbol \ell _\infty $ -Limited Permutation Channel
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Consecutive Switch Codes
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Coding for locality in reconstructing permutations
Designs, Codes and Cryptography | 2018-02-14 | Paper |
On the Capacity of Write-Once Memories
IEEE Transactions on Information Theory | 2017-10-19 | Paper |
Error-Correction of Multidimensional Bursts
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Codes Correcting a Burst of Deletions or Insertions
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Multiple Error-Correcting WOM-Codes
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Coding for the Lee and Manhattan Metrics With Weighing Matrices
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Graded Bit-Error-Correcting Codes With Applications to Flash Memory
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Codes for Write-Once Memories
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Rewriting Codes for Flash Memories
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Time–Space Constrained Codes for Phase-Change Memories
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Optimized Cell Programming for Flash Memories With Quantizers
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
High Sum-Rate Three-Write and Nonbinary WOM Codes
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Short <inline-formula> <tex-math notation="TeX">\(Q\) </tex-math></inline-formula>-Ary Fixed-Rate WOM Codes for Guaranteed Rewrites and With Hot/Cold Write Differentiation
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
On the Capacity of Constrained Permutation Codes for Rank Modulation
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Codes Correcting Erasures and Deletions for Rank Modulation
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Generalized Sphere Packing Bound
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Binary Linear Locally Repairable Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Rank-Modulation Rewrite Coding for Flash Memories
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Systematic Error-Correcting Codes for Permutations and Multi-Permutations
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Information-Theoretic Sneak-Path Mitigation in Memristor Crossbar Arrays
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Codes for Partially Stuck-At Memory Cells
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Correcting Grain-Errors in Magnetic Media
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
| Non-linear Cyclic Codes that Attain the Gilbert-Varshamov Bound | 2017-01-04 | Paper |
Concurrent use of write-once memory
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Approximate sorting of data streams with limited storage
Journal of Combinatorial Optimization | 2016-11-29 | Paper |
| Bounds and Constructions of Codes with Multiple Localities | 2016-01-12 | Paper |
| Optimal Linear and Cyclic Locally Repairable Codes over Small Fields | 2015-02-24 | Paper |
Approximate sorting of data streams with limited storage
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Reducing Coverage Depth in DNA Storage: A Combinatorial Perspective on Random Access Efficiency
(available as arXiv preprint) | N/A | Paper |
