![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Hassan Tavakoli
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [i7]Hassan Tavakoli:
New Capacity Upper Bounds For Binary Deletion Channel. CoRR abs/2103.11904 (2021) - 2020
- [c5]Saeid Pakravan, Hassan Tavakoli:
Capacity Upper Bound and Minimum Energy-per-Bit for AWGN Relay Channel with Channel Side Information. IST 2020: 9-14 - [c4]Maedeh Abbasi Oskouei, Sara Shanazrbeigi, Hassan Tavakoli:
Point-to-Point Threshold Freshness for the Relay Channel: Age of Information Perspective. IST 2020: 90-95
2010 – 2019
- 2019
- [j3]Hassan Tavakoli
:
Overhead minimization of online codes. Telecommun. Syst. 71(2): 205-214 (2019) - 2018
- [j2]Hassan Tavakoli
:
Capacity and Channel Coding for Wireless Point-to-Point Z 2 Channel. Wirel. Pers. Commun. 98(2): 1785-1798 (2018) - 2016
- [c3]Hassan Tavakoli, Abolfazl Razi:
Optimizing low density parity check code for two parallel erasure links. ISITA 2016: 394-397 - 2014
- [i6]Hassan Tavakoli:
A Fast Convergence Density Evolution Algorithm for Optimal Rate LDPC Codes in BEC. CoRR abs/1409.4760 (2014) - [i5]Hassan Tavakoli:
Reducing the Complexity of the Linear Programming Decoding. CoRR abs/1409.4761 (2014) - [i4]Hassan Tavakoli:
Source and Channel Optimal Rate LDPC Code Design for one Sender in BE-MAC with Source Correlation. CoRR abs/1409.4762 (2014) - 2012
- [j1]Hassan Tavakoli, Mahmoud Ahmadian, M. Reza Peyghami
:
Optimal rate irregular low-density parity-check codes in binary erasure channel. IET Commun. 6(13): 2000-2006 (2012) - [i3]Hassan Tavakoli, Mahmoud Ahmadian-Attari, M. Reza Peyghami:
Optimal Rate and Maximum Erasure Probability LDPC Codes in Binary Erasure Channel. CoRR abs/1203.4385 (2012) - [i2]Hassan Tavakoli, Mahmoud Ahmadian, M. Reza Peyghami:
Optimal Rate Irregular LDPC Codes in Binary Erasure Channel. CoRR abs/1211.6279 (2012) - 2011
- [c2]Hassan Tavakoli
, Mahmoud Ahmadian-Attari, M. Reza Peyghami
:
Optimal rate and maximum erasure probability LDPC codes in binary erasure channel. Allerton 2011 - [c1]Hassan Tavakoli
, Mahmoud Ahmadian-Attari, M. Reza Peyghami
:
Optimal rate for irregular LDPC codes in binary erasure channel. ITW 2011: 125-129 - [i1]Hassan Tavakoli, Mahmoud Ahmadian-Attari, M. Reza Peyghami:
Optimal Rate for Irregular LDPC Codes in Binary Erasure Channel. CoRR abs/1108.1572 (2011)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint