Bashar Huleihel

Orcid: 0000-0001-9962-2384

According to our database1, Bashar Huleihel authored at least 14 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Capacity of Finite-State Channels With Delayed Feedback.
IEEE Trans. Inf. Theory, January, 2024

The Duality Upper Bound for Finite-State Channels with Feedback.
CoRR, 2024

On Rate Distortion via Constrained Optimization of Estimated Mutual Information.
IEEE Access, 2024

Neural Estimation of Multi-User Capacity Regions Over Discrete Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Code Rate Optimization via Neural Polar Decoders.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Data-Driven Neural Polar Codes for Unknown Channels With and Without Memory.
CoRR, 2023

Rate Distortion via Constrained Estimated Mutual Information Minimization.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Neural Estimation of Multi-User Capacity Regions.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Data-Driven Polar Codes for Unknown Channels With and Without Memory.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Capacity of the Trapdoor Channel with Delayed Feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Computable Upper Bounds on the Capacity of Finite-State Channels.
IEEE Trans. Inf. Theory, 2021

2020
Graph-Based Encoders and Their Performance for Finite-State Channels With Feedback.
IEEE Trans. Commun., 2020

2019
Computable Upper Bounds for Unifilar Finite-State Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Graph-based Encoders and their Achievable Rates for Channels with Feedback.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018


  Loading...