default search action
Bashar Huleihel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Dor Tsur
, Bashar Huleihel
On Rate Distortion via Constrained Optimization of Estimated Mutual Information. IEEE Access 12: 137970-137987 (2024) - [j4]Bashar Huleihel
Capacity of Finite-State Channels With Delayed Feedback. IEEE Trans. Inf. Theory 70(1): 16-29 (2024) - [j3]Ziv Aharoni
Data-Driven Neural Polar Decoders for Unknown Channels With and Without Memory. IEEE Trans. Inf. Theory 70(12): 8495-8510 (2024) - [c8]Bashar Huleihel, Dor Tsur, Ziv Aharoni, Oron Sabag, Haim H. Permuter:
Neural Estimation of Multi-User Capacity Regions Over Discrete Channels. ISIT 2024: 1191-1196 - [c7]Ziv Aharoni, Bashar Huleihel, Henry D. Pfister, Haim H. Permuter:
Code Rate Optimization via Neural Polar Decoders. ISIT 2024: 2424-2429 - [i5]Bashar Huleihel, Oron Sabag, Ziv Aharoni, Haim H. Permuter:
The Duality Upper Bound for Finite-State Channels with Feedback. CoRR abs/2401.05102 (2024) - 2023
- [c6]Dor Tsur, Bashar Huleihel, Haim H. Permuter:
Rate Distortion via Constrained Estimated Mutual Information Minimization. ISIT 2023: 695-700 - [c5]Ziv Aharoni, Bashar Huleihel, Henry D. Pfister, Haim H. Permuter:
Data-Driven Polar Codes for Unknown Channels With and Without Memory. ISIT 2023: 1890-1895 - [c4]Bashar Huleihel, Dor Tsur, Ziv Aharoni, Oron Sabag
Neural Estimation of Multi-User Capacity Regions. ISIT 2023: 2380-2385 - [i4]Bashar Huleihel, Oron Sabag
Capacity of Finite-State Channels with Delayed Feedback. CoRR abs/2303.18008 (2023) - [i3]Ziv Aharoni, Bashar Huleihel, Henry D. Pfister, Haim H. Permuter:
Data-Driven Neural Polar Codes for Unknown Channels With and Without Memory. CoRR abs/2309.03148 (2023) - 2022
- [c3]Bashar Huleihel, Oron Sabag
Capacity of the Trapdoor Channel with Delayed Feedback. ISIT 2022: 492-497 - 2021
- [j2]Bashar Huleihel
Computable Upper Bounds on the Capacity of Finite-State Channels. IEEE Trans. Inf. Theory 67(9): 5674-5692 (2021) - 2020
- [j1]Oron Sabag
Graph-Based Encoders and Their Performance for Finite-State Channels With Feedback. IEEE Trans. Commun. 68(4): 2106-2117 (2020)
2010 – 2019
- 2019
- [c2]Bashar Huleihel, Oron Sabag
Computable Upper Bounds for Unifilar Finite-State Channels. ISIT 2019: 1892-1896 - [i2]Oron Sabag, Bashar Huleihel, Haim H. Permuter:
Graph-Based Encoders and their Performance for Finite-State Channels with Feedback. CoRR abs/1907.08063 (2019) - [i1]Bashar Huleihel, Oron Sabag, Haim H. Permuter, Navin Kashyap, Shlomo Shamai:
Computable Upper Bounds on the Capacity of Finite-State Channels. CoRR abs/1911.02113 (2019) - 2018
- [c1]Oron Sabag
Graph-based Encoders and their Achievable Rates for Channels with Feedback. ISIT 2018: 1121-1125
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:32 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: