default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDor Elimelech
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Dor Elimelech
, Moshe Schwartz:
The second-order football-pool problem and the optimal rate of generalized-covering codes. J. Comb. Theory A 203: 105834 (2024)- [j4]Dor Elimelech, Tom Meyerovitch, Moshe Schwartz:
Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems. IEEE Trans. Inf. Theory 70(6): 4044-4063 (2024) - [j3]Dor Elimelech, Wasim Huleihel:
Detection of Correlated Random Vectors. IEEE Trans. Inf. Theory 70(12): 8942-8960 (2024) - [c8]Dor Elimelech, Wasim Huleihel:
Detection of Correlated Random Vectors. ISIT 2024: 1257-1262 - [i7]Dor Elimelech, Wasim Huleihel:
Detection of Correlated Random Vectors. CoRR abs/2401.13429 (2024) - 2023
- [c7]Dor Elimelech, Wasim Huleihel:
Phase Transitions in the Detection of Correlated Databases. ICML 2023: 9246-9266 - [c6]Dor Elimelech, Moshe Schwartz:
The Optimal Rate of Second-Order Generalized-Covering Codes. ISIT 2023: 222-227 - [c5]Dor Elimelech, Tom Meyerovitch, Moshe Schwartz:
Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems. ISIT 2023: 2673-2678 - [c4]Dor Elimelech, Tom Meyerovitch, Moshe Schwartz:
Bounds on the Essential Covering Radius of Constrained Systems. ISIT 2023: 2679-2684 - [i6]Dor Elimelech, Tom Meyerovitch, Moshe Schwartz:
Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems. CoRR abs/2302.02363 (2023) - [i5]Dor Elimelech, Wasim Huleihel:
Phase Transitions in the Detection of Correlated Databases. CoRR abs/2302.03380 (2023) - 2022
- [j2]Dor Elimelech, Hengjia Wei, Moshe Schwartz:
On the Generalized Covering Radii of Reed-Muller Codes. IEEE Trans. Inf. Theory 68(7): 4378-4391 (2022) - [c3]Dor Elimelech, Hengjia Wei, Moshe Schwartz:
On the Generalized Covering Radii of Reed-Muller Codes. ISIT 2022: 1749-1754 - [i4]Dor Elimelech, Moshe Schwartz:
The Second-Order Football-Pool Problem and the Optimal Rate of Generalized-Covering Codes. CoRR abs/2210.00531 (2022) - 2021
- [j1]Dor Elimelech, Marcelo Firer, Moshe Schwartz:
The Generalized Covering Radii of Linear Codes. IEEE Trans. Inf. Theory 67(12): 8070-8085 (2021) - [c2]Dor Elimelech, Marcelo Firer, Moshe Schwartz:
The Generalized Covering Radii of Linear Codes. ISIT 2021: 302-307 - [i3]Dor Elimelech, Hengjia Wei, Moshe Schwartz:
On the Generalized Covering Radii of Reed-Muller Codes. CoRR abs/2107.09902 (2021) - 2020
- [c1]Dor Elimelech:
The Capacity of Multidimensional Permutations with Restricted Movement. ISIT 2020: 120-125 - [i2]Dor Elimelech, Marcelo Firer, Moshe Schwartz:
The Generalized Covering Radii of Linear Codes. CoRR abs/2012.06467 (2020)
2010 – 2019
- 2019
- [i1]Dor Elimelech:
Permutations With Restricted Movement. CoRR abs/1911.02233 (2019)
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 2025-01-09 20:39 CET 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:
