| Coding over sets for DNA storage A Lenz, PH Siegel, A Wachter-Zeh, E Yaakobi IEEE Transactions on Information Theory 66 (4), 2331-2351, 2019 | 133 | 2019 |
| An upper bound on the capacity of the DNA storage channel A Lenz, PH Siegel, A Wachter-Zeh, E Yaakobi 2019 IEEE Information Theory Workshop (ITW), 1-5, 2019 | 39 | 2019 |
| Anchor-based correction of substitutions in indexed sets A Lenz, PH Siegel, A Wachter-Zeh, E Yaakobi 2019 IEEE International Symposium on Information Theory (ISIT), 757-761, 2019 | 38 | 2019 |
| Optimal codes correcting a burst of deletions of variable length A Lenz, N Polyanskii 2020 IEEE International Symposium on Information Theory (ISIT), 757-762, 2020 | 32 | 2020 |
| Achieving the capacity of the DNA storage channel A Lenz, PH Siegel, A Wachter-Zeh, E Yaakohi ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and …, 2020 | 30 | 2020 |
| Coding for efficient DNA synthesis A Lenz, Y Liu, C Rashtchian, PH Siegel, A Wachter-Zeh, E Yaakobi 2020 IEEE International Symposium on Information Theory (ISIT), 2885-2890, 2020 | 29 | 2020 |
| Clustering-correcting codes T Shinkar, E Yaakobi, A Lenz, A Wachter-Zeh IEEE Transactions on Information Theory 68 (3), 1560-1580, 2021 | 25 | 2021 |
| Concatenated codes for recovery from multiple reads of DNA sequences A Lenz, I Maarouf, L Welter, A Wachter-Zeh, E Rosnes, AG i Amat 2020 IEEE Information Theory Workshop (ITW), 1-5, 2021 | 25 | 2021 |
| Bounds and constructions for multi-symbol duplication error correcting codes A Lenz, N Jünger, A Wachter-Zeh arXiv preprint arXiv:1807.02874, 2018 | 25 | 2018 |
| Duplication-correcting codes A Lenz, A Wachter-Zeh, E Yaakobi Designs, Codes and Cryptography 87, 277-298, 2019 | 24 | 2019 |
| Variable-length bit mapping and error-correcting codes for higher-order alphabet pufs—extended version V Immler, M Hiller, Q Liu, A Lenz, A Wachter-Zeh Journal of Hardware and Systems Security 3, 78-93, 2019 | 23 | 2019 |
| Concatenated codes for multiple reads of a DNA sequence I Maarouf, A Lenz, L Welter, A Wachter-Zeh, E Rosnes, AG i Amat IEEE Transactions on Information Theory 69 (2), 910-927, 2022 | 20 | 2022 |
| Bounds on codes correcting tandem and palindromic duplications A Lenz, A Wachter-Zeh, E Yaakobi arXiv preprint arXiv:1707.00052, 2017 | 16 | 2017 |
| Achievable rates of concatenated codes in DNA storage under substitution errors A Lenz, L Welter, S Puchinger 2020 International Symposium on Information Theory and Its Applications …, 2020 | 15 | 2020 |
| Covering codes using insertions or deletions A Lenz, C Rashtchian, PH Siegel, E Yaakobi IEEE Transactions on Information Theory 67 (6), 3376-3388, 2020 | 9 | 2020 |
| Function-correcting codes A Lenz, R Bitar, A Wachter-Zeh, E Yaakobi IEEE Transactions on Information Theory 69 (9), 5604-5618, 2023 | 8 | 2023 |
| The noisy drawing channel: Reliable data storage in dna sequences A Lenz, PH Siegel, A Wachter-Zeh, E Yaakobi IEEE Transactions on Information Theory 69 (5), 2757-2778, 2022 | 8 | 2022 |
| Multivariate analytic combinatorics for cost constrained channels and subsequence enumeration A Lenz, S Melczer, C Rashtchian, PH Siegel arXiv preprint arXiv:2111.06105, 2021 | 8 | 2021 |
| Index-based concatenated codes for the multi-draw DNA storage channel L Welter, I Maarouf, A Lenz, A Wachter-Zeh, E Rosnes, AGI Amat 2023 IEEE Information Theory Workshop (ITW), 383-388, 2023 | 7 | 2023 |
| DNA Synthesis Using Shortmers M Abu-Sini, A Lenz, E Yaakobi 2023 IEEE International Symposium on Information Theory (ISIT), 585-590, 2023 | 6 | 2023 |