| Publication | Date of Publication | Type |
|---|
| On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric | 2024-03-19 | Paper |
| The Noisy Drawing Channel: Reliable Data Storage in DNA Sequences | 2024-03-19 | Paper |
| On Hierarchies of Balanced Sequences | 2024-03-19 | Paper |
| Almost Optimal Construction of Functional Batch Codes Using Extended Simplex Codes | 2024-03-14 | Paper |
| Correcting Deletions With Multiple Reads | 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 | 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 | 2022-07-13 | Paper |
| Clustering-Correcting Codes | 2022-05-30 | Paper |
| Endurance-Limited Memories: Capacity and Codes | 2022-05-30 | Paper |
| Coding for Sequence Reconstruction for Single Edits | 2022-02-17 | Paper |
| Array Codes for Functional PIR and Batch Codes | 2022-02-17 | Paper |
| Multi-Server Weakly-Private Information Retrieval | 2022-02-17 | Paper |
| Partial MDS Codes With Regeneration | 2022-02-17 | Paper |
| On Levenshtein’s Reconstruction Problem Under Insertions, Deletions, and Substitutions | 2022-02-17 | Paper |
| Private Proximity Retrieval Codes | 2022-02-17 | Paper |
| Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications | 2022-02-17 | Paper |
| Criss-Cross Insertion and Deletion Correcting Codes | 2022-02-17 | Paper |
| Lifted Reed-Solomon Codes and Lifted Multiplicity Codes | 2022-02-17 | Paper |
| Repeat-Free Codes | 2021-09-07 | Paper |
| Covering Codes Using Insertions or Deletions | 2021-07-23 | Paper |
| Codes Over Trees | 2021-07-23 | Paper |
| Reconstruction of Strings From Their Substrings Spectrum | 2021-07-23 | Paper |
| PIR codes with short block length | 2021-03-17 | Paper |
| Bounds and Constructions of Codes Over Symbol-Pair Read Channels | 2020-09-29 | Paper |
| Coding Over Sets for DNA Storage | 2020-09-29 | Paper |
| Multi-Erasure Locally Recoverable Codes Over Small Fields: A Tensor Product Approach | 2020-09-29 | Paper |
| Explicit and Efficient WOM Codes of Finite Length | 2020-09-29 | Paper |
| Private Information Retrieval in Graph-Based Replication Systems | 2020-09-29 | Paper |
| Double and Triple Node-Erasure-Correcting Codes Over Complete Graphs | 2020-09-29 | Paper |
| Bounds on the Length of Functional PIR and Batch Codes | 2020-09-29 | Paper |
| Codes for Graph Erasures | 2020-01-28 | Paper |
| On the Uncertainty of Information Retrieval in Associative Memories | 2019-07-19 | Paper |
| Mutually Uncorrelated Codes for DNA Storage | 2019-07-19 | Paper |
| Constructions of Partial MDS Codes Over Small Fields | 2019-07-19 | Paper |
| Duplication-correcting codes | 2019-02-20 | Paper |
| Nearly Optimal Constructions of PIR and Batch Codes | 2019-01-28 | Paper |
| Reconstruction of Sequences Over Non-Identical Channels | 2019-01-28 | Paper |
| Rank-Modulation Codes for DNA Storage With Shotgun Sequencing | 2019-01-18 | Paper |
| Coding for Racetrack Memories | 2018-12-04 | Paper |
| Multiset combinatorial batch codes | 2018-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4570859 | 2018-07-09 | Paper |
| Coding for the $\boldsymbol \ell _\infty $ -Limited Permutation Channel | 2018-06-27 | Paper |
| Consecutive Switch Codes | 2018-06-27 | Paper |
| Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction | 2018-06-27 | Paper |
| Coding for locality in reconstructing permutations | 2018-02-14 | Paper |
| On the Capacity of Write-Once Memories | 2017-10-19 | Paper |
| Error-Correction of Multidimensional Bursts | 2017-08-08 | Paper |
| Codes Correcting a Burst of Deletions or Insertions | 2017-07-27 | Paper |
| Multiple Error-Correcting WOM-Codes | 2017-07-12 | Paper |
| Graded Bit-Error-Correcting Codes With Applications to Flash Memory | 2017-06-08 | Paper |
| Codes for Write-Once Memories | 2017-06-08 | Paper |
| Rewriting Codes for Flash Memories | 2017-06-08 | Paper |
| Coding for the Lee and Manhattan Metrics With Weighing Matrices | 2017-06-08 | Paper |
| Time–Space Constrained Codes for Phase-Change Memories | 2017-06-08 | Paper |
| High Sum-Rate Three-Write and Nonbinary WOM Codes | 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 | 2017-05-16 | Paper |
| Optimized Cell Programming for Flash Memories With Quantizers | 2017-05-16 | Paper |
| Binary Linear Locally Repairable Codes | 2017-04-28 | Paper |
| Information-Theoretic Sneak-Path Mitigation in Memristor Crossbar Arrays | 2017-04-28 | Paper |
| Systematic Error-Correcting Codes for Permutations and Multi-Permutations | 2017-04-28 | Paper |
| Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols | 2017-04-28 | Paper |
| Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels | 2017-04-28 | Paper |
| On the Capacity of Constrained Permutation Codes for Rank Modulation | 2017-04-28 | Paper |
| Codes for Partially Stuck-At Memory Cells | 2017-04-28 | Paper |
| Codes Correcting Erasures and Deletions for Rank Modulation | 2017-04-28 | Paper |
| Rank-Modulation Rewrite Coding for Flash Memories | 2017-04-28 | Paper |
| Correcting Grain-Errors in Magnetic Media | 2017-04-28 | Paper |
| Generalized Sphere Packing Bound | 2017-04-28 | Paper |
| Non-linear Cyclic Codes that Attain the Gilbert-Varshamov Bound | 2017-01-04 | Paper |
| Concurrent Use of Write-Once Memory | 2016-12-01 | Paper |
| Approximate sorting of data streams with limited storage | 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 | 2014-09-26 | Paper |
| Reducing Coverage Depth in DNA Storage: A Combinatorial Perspective on Random Access Efficiency | 0001-01-03 | Paper |
