Codes for erasures over directed graphs. - Lev Yohananov; Eitan Yaakobi (ITW, 2017)

Double and Triple Node-Erasure-Correcting Codes over Graphs. - Lev Yohananov; Yuval Efron; Eitan Yaakobi (ISIT, 2019)

Codes for Graph Erasures. - Lev Yohananov; Eitan Yaakobi (IEEE Trans. Inf. Theory, 2019)

Double and Triple Node-Erasure-Correcting Codes Over Complete Graphs. - Lev Yohananov; Yuval Efron; Eitan Yaakobi (IEEE Trans. Inf. Theory, 2020)

Almost Optimal Construction of Functional Batch Codes Using Hadamard Codes. - Lev Yohananov; Eitan Yaakobi (ISIT, 2021)

Codes Over Trees. - Lev Yohananov; Eitan Yaakobi (IEEE Trans. Inf. Theory, 2021)

Storage codes on triangle-free graphs with asymptotically unit rate. - Alexander Barg; Moshe Schwartz 001; Lev Yohananov (CoRR, 2022)

Almost Optimal Construction of Functional Batch Codes Using Extended Simplex Codes. - Lev Yohananov; Eitan Yaakobi (IEEE Trans. Inf. Theory, 2022)

Codes over Graphs. - Lev Yohananov (2022)

Optimal Reverse-Complement-Duplication Error-Correcting Codes. - Lev Yohananov; Moshe Schwartz 001 (CoRR, 2023)

Storage Codes on Coset Graphs with Asymptotically Unit Rate. - Alexander Barg; Moshe Schwartz 001; Lev Yohananov (Comb., 2024)

The second generalized covering radius of binary primitive double-error-correcting BCH codes. - Lev Yohananov; Moshe Schwartz 001 (Finite Fields Their Appl., 2025)

Optimal Functional 2s-1-Batch Codes: Exploring New Sufficient Conditions. - Lev Yohananov; Isaac Barouch Essayag (CoRR, 2025)

On the coding capacity of reverse-complement and palindromic duplication-correcting codes. - Lev Yohananov; Moshe Schwartz 001 (Des. Codes Cryptogr., 2025)