Ohad Elishco

Orcid: 0000-0002-8551-1592

Affiliations:
  • Ben-Gurion University of the Negev, Beersheba, Israel
  • University of Maryland, College Park, MD, USA


According to our database1, Ohad Elishco authored at least 29 papers between 2011 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
On Multidimensional 2-Weight-Limited Burst-Correcting Codes.
CoRR, October, 2025

More on codes for combinatorial composite DNA.
Des. Codes Cryptogr., August, 2025

Making it to First: The Random Access Problem in DNA Storage.
CoRR, January, 2025

Coding for Ordered Composite DNA Sequences.
Proceedings of the IEEE International Symposium on Information Theory, 2025

2024
Storage codes and recoverable systems on lines and grids.
Des. Codes Cryptogr., December, 2024

Bounds and Constructions for Generalized Batch Codes.
IEEE Trans. Inf. Theory, October, 2024

Codes Over Absorption Channels.
IEEE Trans. Inf. Theory, June, 2024

Reconstruction of a Single String From a Part of Its Composition Multiset.
IEEE Trans. Inf. Theory, June, 2024

Codes Correcting Two Bursts of Exactly <i>b</i> Deletions.
CoRR, 2024

On the Long-Term Behavior of k-tuples Frequencies in Mutation Systems.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Optimal Reference for DNA Synthesis.
IEEE Trans. Inf. Theory, November, 2023

Codes Over Absorption Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Recoverable Systems.
IEEE Trans. Inf. Theory, 2022

Recoverable systems on lines and grids.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Capacity and Construction of Recoverable Systems.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2019
The Entropy Rate of Some Pólya String Models.
IEEE Trans. Inf. Theory, 2019

Throughput and Delay Analysis for Coded ARQ.
Proceedings of the International Symposium on Modeling and Optimization in Mobile, 2019

Repeat-Free Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Capacity of dynamical storage systems.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
On Independence and Capacity of Multidimensional Semiconstrained Systems.
IEEE Trans. Inf. Theory, 2018

Blind Group Testing.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Bounds and Constructions of Codes over Symbol-Pair Read Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Multidimensional semiconstrained systems.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Encoding semiconstrained systems.
Proceedings of the IEEE International Symposium on Information Theory, 2016

The capacity of some Pólya string models.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Semiconstrained systems.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Capacity and Coding for the Ising Channel With Feedback.
IEEE Trans. Inf. Theory, 2014

Semi-constrained Systems.
CoRR, 2014

2011
Capacity of the Ising channel with feedback.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011


  Loading...