default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOhad Elishco
Person information
- affiliation: Ben-Gurion University of the Negev, Beersheba, Israel
- affiliation: University of Maryland, College Park, MD, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Zuo Ye
, Ohad Elishco:
Reconstruction of a Single String From a Part of Its Composition Multiset. IEEE Trans. Inf. Theory 70(6): 3922-3940 (2024)- [j13]Zuo Ye, Wenjun Yu, Ohad Elishco:
Codes Over Absorption Channels. IEEE Trans. Inf. Theory 70(6): 3981-4001 (2024) - [j12]Xiangliang Kong, Ohad Elishco:
Bounds and Constructions for Generalized Batch Codes. IEEE Trans. Inf. Theory 70(10): 6857-6876 (2024) - [c14]Ohad Elishco:
On the Long-Term Behavior of k-tuples Frequencies in Mutation Systems. ISIT 2024: 1736-1741 - [i15]Ohad Elishco:
On the Long-Term behavior of k-tuples Frequencies in Mutation Systems. CoRR abs/2401.04020 (2024) - [i14]Zuo Ye, Wenjun Yu, Ohad Elishco:
Codes Correcting Two Bursts of Exactly b Deletions. CoRR abs/2408.03113 (2024) - 2023
- [j11]Ohad Elishco, Wasim Huleihel:
Optimal Reference for DNA Synthesis. IEEE Trans. Inf. Theory 69(11): 6941-6955 (2023) - [c13]Zuo Ye, Ohad Elishco:
Codes Over Absorption Channels. ISIT 2023: 636-641 - [i13]Zuo Ye, Ohad Elishco:
Codes Over Absorption Channels. CoRR abs/2302.09842 (2023) - [i12]Alexander Barg, Ohad Elishco, Ryan Gabrys, Geyang Wang, Eitan Yaakobi:
Storage codes and recoverable systems on lines and grids. CoRR abs/2308.14558 (2023) - [i11]Xiangliang Kong, Ohad Elishco:
Bounds and Constructions for Generalized Batch Codes. CoRR abs/2309.06806 (2023) - 2022
- [j10]Ohad Elishco, Alexander Barg:
Recoverable Systems. IEEE Trans. Inf. Theory 68(6): 3681-3699 (2022) - [c12]Alexander Barg, Ohad Elishco, Ryan Gabrys, Eitan Yaakobi:
Recoverable systems on lines and grids. ISIT 2022: 2637-2642 - [i10]Ohad Elishco, Wasim Huleihel:
Optimal Reference for DNA Synthesis. CoRR abs/2204.07013 (2022) - [i9]Zuo Ye, Ohad Elishco:
Reconstruction of a Single String from a Part of its Composition Multiset. CoRR abs/2208.14963 (2022) - 2021
- [j9]Ohad Elishco, Alexander Barg:
Capacity of Dynamical Storage Systems. IEEE Trans. Inf. Theory 67(1): 329-346 (2021) - [j8]Ohad Elishco, Ryan Gabrys, Eitan Yaakobi, Muriel Médard:
Repeat-Free Codes. IEEE Trans. Inf. Theory 67(9): 5749-5764 (2021) - [c11]Ohad Elishco, Alexander Barg:
Capacity and Construction of Recoverable Systems. ISIT 2021: 3273-3278 - 2020
- [j7]Ohad Elishco, Ryan Gabrys, Eitan Yaakobi:
Bounds and Constructions of Codes Over Symbol-Pair Read Channels. IEEE Trans. Inf. Theory 66(3): 1385-1395 (2020) - [i8]Ohad Elishco, Alexander Barg:
Recoverable Systems. CoRR abs/2010.00589 (2020)
2010 – 2019
- 2019
- [j6]Wasim Huleihel, Ohad Elishco, Muriel Médard:
Blind Group Testing. IEEE Trans. Inf. Theory 65(8): 5050-5063 (2019) - [j5]Ohad Elishco, Farzad Farnoud Hassanzadeh, Moshe Schwartz, Jehoshua Bruck:
The Entropy Rate of Some Pólya String Models. IEEE Trans. Inf. Theory 65(12): 8180-8193 (2019) - [c10]Ohad Elishco, Ryan Gabrys, Muriel Médard, Eitan Yaakobi:
Repeat-Free Codes. ISIT 2019: 932-936 - [c9]Ohad Elishco, Alexander Barg:
Capacity of dynamical storage systems. ISIT 2019: 1562-1566 - [c8]Derya Malak, Ohad Elishco, Muriel Médard, Edmund M. Yeh:
Throughput and Delay Analysis for Coded ARQ. WiOpt 2019: 1-8 - [i7]Ohad Elishco, Alexander Barg:
Capacity of dynamical storage systems. CoRR abs/1908.09900 (2019) - [i6]Ohad Elishco, Ryan Gabrys, Eitan Yaakobi, Muriel Médard:
Repeat-Free Codes. CoRR abs/1909.05694 (2019) - 2018
- [j4]Ohad Elishco, Tom Meyerovitch, Moshe Schwartz:
On Encoding Semiconstrained Systems. IEEE Trans. Inf. Theory 64(4): 2474-2484 (2018) - [j3]Ohad Elishco, Tom Meyerovitch, Moshe Schwartz:
On Independence and Capacity of Multidimensional Semiconstrained Systems. IEEE Trans. Inf. Theory 64(10): 6461-6483 (2018) - [c7]Ohad Elishco, Ryan Gabrys, Eitan Yaakobi:
Bounds and Constructions of Codes over Symbol-Pair Read Channels. ISIT 2018: 2505-2509 - [c6]Wasim Huleihel, Ohad Elishco, Muriel Médard:
Blind Group Testing. ISIT 2018: 2594-2598 - [i5]Ohad Elishco, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
The Capacity of Some Pólya String Models. CoRR abs/1808.06062 (2018) - 2017
- [c5]Ohad Elishco, Tom Meyerovitch, Moshe Schwartz:
Multidimensional semiconstrained systems. ISIT 2017: 1490-1494 - [i4]Ohad Elishco, Tom Meyerovitch, Moshe Schwartz:
On Independence and Capacity of Multidimensional Semiconstrained Systems. CoRR abs/1709.05105 (2017) - 2016
- [j2]Ohad Elishco, Tom Meyerovitch, Moshe Schwartz:
Semiconstrained Systems. IEEE Trans. Inf. Theory 62(4): 1688-1702 (2016) - [c4]Ohad Elishco, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
The capacity of some Pólya string models. ISIT 2016: 270-274 - [c3]Ohad Elishco, Tom Meyerovitch, Moshe Schwartz:
Encoding semiconstrained systems. ISIT 2016: 395-399 - [i3]Ohad Elishco, Tom Meyerovitch, Moshe Schwartz:
Encoding Semiconstrained Systems. CoRR abs/1601.05594 (2016) - 2015
- [c2]Ohad Elishco, Tom Meyerovitch, Moshe Schwartz:
Semiconstrained systems. ISIT 2015: 246-250 - 2014
- [j1]Ohad Elishco, Haim H. Permuter:
Capacity and Coding for the Ising Channel With Feedback. IEEE Trans. Inf. Theory 60(9): 5138-5149 (2014) - [i2]Moshe Schwartz, Tom Meyerovitch, Ohad Elishco:
Semi-constrained Systems. CoRR abs/1401.2612 (2014) - 2012
- [i1]Ohad Elishco, Haim H. Permuter:
Capacity and coding for the Ising Channel with Feedback. CoRR abs/1205.4674 (2012) - 2011
- [c1]Ohad Elishco, Haim H. Permuter:
Capacity of the Ising channel with feedback. ISIT 2011: 3004-3008
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-13 18:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
