I am a theoretical researcher specializing in Coding Theory. My interests revolve around mathematical problems in coding theory, algebra, and combinatorics. My previous research delved into building error-correcting codes in novel and previously unexplored metrics.
I worked on asymptotic estimates of code parameters in various metric spaces, such as vertex cover, tree distance, rank metric, and subspace metric. My focus extended to coding problems addressing erasures of edges and nodes on graphs and trees, private information retrieval, and batch codes. More recently, my work encompassed several distributed storage models, DNA storage, and various other challenges. I explored algebraic code constructions for data represented on graphs, where the values of its neighbors determine the contents of a vertex.
Education
B.A. in Computer Science 2011–2016, Technion – Israel Institute of Technology
M.Sc. in Computer Science 2016–2017, Technion – Israel Institute of Technology, Supervisor: Prof. Eitan Yaakobi
Thesis: “Codes over Graphs”, Transitioned to direct Ph.D.
Ph.D. in Computer Science 2017–2022, Technion – Israel Institute of Technology, Supervisor: Prof. Eitan Yaakobi, Thesis: “Codes over Graphs”
Employment History
Postdoctoral Researcher 2022–Present, UMD – University of Maryland, Department of ECE and Institute of Systems Research, Supervisor: Prof. Alexandr Barg
Postdoctoral Researcher 2022–Present, Ben-Gurion University of the Negev, School of ECE, Supervisor: Prof. Moshe Schwartz IT Department Manager 2006–2011,IDF
Courses Taught
Combinatorics for Computer Science 2016–2023, Technion – Israel Institute of Technology, Lecturer in Charge
Undergraduate compulsory course, Modern Algebra 2021–2023, Reichman University, Lecturer in Charge Undergraduate compulsory course
Industrial Project 2018–Present, Technion – Israel Institute of Technology, Organizer and Manager,
Undergraduate compulsory course, Introduction to Computer Science 2022–Present
Technion – Israel Institute of Technology, Lecturer, Undergraduate compulsory course
Introduction to Computer - Python 2023–Present, Technion – Israel Institute of Technology, Lecturer, Undergraduate compulsory course
Awards, Citations, Honors, Fellowships
The Public Education Foundation 2013–2016
Selim and Rachel Benin Scholarship Fund 2017
ISIT Student Travel Grant 2017
Excellence Scholarship Faculty Funding (5 times) 2016–2020
Jacobs Qualcomm Scholarship (2 times) 2020 – 2021
Vatat Scholarship for Ultra-Orthodox Post-Doc students Abroad 2023–2024
Society Memberships
IEEE 2016–Present
Student Member
Scientific Publications
Refereed Journal Papers
[J1] L. Yohananov and E. Yaakobi, “ Codes for graph erasures,” IEEE Transactions Information Theory,
vol. 65, no. 9, pp. 5433 – 5453, Sep. 2019.
[J2] L. Yohananov, Y. Efron, and E. Yaakobi, “ Double and triple node-erasure correcting codes over
graphs,” IEEE Transactions Information Theory, vol. 66, no. 7, pp. 4089 – 4103, Jul. 2020.
[J3] L. Yohananov and E. Yaakobi, “ Codes over trees,” IEEE Transactions Information Theory, vol. 67,
no. 6, pp. 3599 – 3622, Jun. 2021.
[J4] L. Yohananov and E. Yaakobi, “ Almost optimal construction of functional batch codes using
extended Simplex codes,” IEEE Transactions Information Theory, 2021.
[J5] A. Barg, M. Schwartz, and L. Yohananov, “ Storage codes on triangle-free graphs with asymp-
totically unit rate,” Submitted to Combinatorica Journal, 2022.
Papers in Conference Proceedings
[C1] L. Yohananov and E. Yaakobi, “Codes for graph erasures,” IEEE International Symposium on Information Theory, pp. 844–848, Aachen, Germany, Jul. 2017.
[C2] L. Yohananov and E. Yaakobi, “Codes for erasures over directed graphs,” IEEE Information Theory Workshop, pp. 116–120, Kaohsiung, Taiwan, Nov. 2017.
[C3] L. Yohananov, Y. Efron, and E. Yaakobi, “Double and triple node-erasure correcting codes over graphs,” IEEE International Symposium on Information Theory, pp. 1582-1586, Paris, France, Jul. 2019.
[C4] L. Yohananov and E. Yaakobi, “Codes over trees,” IEEE International Symposium on Information Theory, LA, CA, USA, Jan. 2020.
[C5] L. Yohananov and E. Yaakobi, “Almost optimal construction of functional batch codes using extended Simplex codes,” IEEE International Symposium on Information Theory, 2021.
ArXiv Papers
[C6] L. Yohananov and M. Schwartz, “Optimal reverse-complement-duplication error-correcting codes,” arXiv:2312.00394, 2023.