Hassan Tavakoli

Orcid: 0000-0002-5995-4787

According to our database1, Hassan Tavakoli authored at least 14 papers between 2011 and 2022.

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

2022
A Tighter Lower Bound on the Capacity of the Cascading Binary Deletion Channel and Binary Symmetric Channel.
Proceedings of the International Symposium on Information Theory and Its Applications, 2022

2021
New Capacity Upper Bounds For Binary Deletion Channel.
CoRR, 2021

2020
Capacity Upper Bound and Minimum Energy-per-Bit for AWGN Relay Channel with Channel Side Information.
Proceedings of the 10th International Symposium on Telecommunications, 2020

Point-to-Point Threshold Freshness for the Relay Channel: Age of Information Perspective.
Proceedings of the 10th International Symposium on Telecommunications, 2020

2019
Overhead minimization of online codes.
Telecommun. Syst., 2019

2018
Capacity and Channel Coding for Wireless Point-to-Point Z 2 Channel.
Wirel. Pers. Commun., 2018

2016
Optimizing low density parity check code for two parallel erasure links.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

2014
Source and Channel Optimal Rate LDPC Code Design for one Sender in BE-MAC with Source Correlation.
CoRR, 2014

Reducing the Complexity of the Linear Programming Decoding.
CoRR, 2014

A Fast Convergence Density Evolution Algorithm for Optimal Rate LDPC Codes in BEC.
CoRR, 2014

2012
Optimal rate irregular low-density parity-check codes in binary erasure channel.
IET Commun., 2012

Optimal Rate Irregular LDPC Codes in Binary Erasure Channel
CoRR, 2012

2011
Optimal rate for irregular LDPC codes in binary erasure channel.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Optimal rate and maximum erasure probability LDPC codes in binary erasure channel.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011


  Loading...