default search action
Homayoon Hatami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i5]Hamid Saber, Homayoon Hatami, Jung Hyun Bae:
Simplified Successive Cancellation List Decoding of PAC Codes. CoRR abs/2401.13922 (2024) - 2023
- [c9]Linfang Wang, Hamid Saber, Homayoon Hatami, Mohammad Vahid Jamali, Jung Hyun Bae:
Rate-Matched Turbo Autoencoder: A Deep Learning Based Multi-Rate Channel Autoencoder. ICC 2023: 6355-6360 - [c8]Homayoon Hatami, Hamid Saber, Jung Hyun Bae:
Performance Evaluation of Turbo Autoencoder with Different Interleavers. VTC2023-Spring 2023: 1-6 - [i4]Mohammad Vahid Jamali, Hamid Saber, Homayoon Hatami, Jung Hyun Bae:
ProductAE: Toward Deep Learning Driven Error-Correction Codes of Large Dimensions. CoRR abs/2303.16424 (2023) - 2022
- [c7]Hamid Saber, Homayoon Hatami, Jung Hyun Bae:
List Autoencoder: Towards Deep Learning Based Reliable Transmission Over Noisy Channels. GLOBECOM 2022: 1454-1459 - [c6]Mohammad Vahid Jamali, Hamid Saber, Homayoon Hatami, Jung Hyun Bae:
ProductAE: Toward Training Larger Channel Codes based on Neural Product Codes. ICC 2022: 3898-3903 - 2021
- [c5]Hikmet Yildiz, Homayoon Hatami, Hamid Saber, Yuan-Sheng Cheng, Jung Hyun Bae:
Interleaver Design and Pairwise Codeword Distance Distribution Enhancement for Turbo Autoencoder. GLOBECOM 2021: 1-6 - [i3]Mohammad Vahid Jamali, Hamid Saber, Homayoon Hatami, Jung Hyun Bae:
ProductAE: Towards Training Larger Channel Codes based on Neural Product Codes. CoRR abs/2110.04466 (2021) - [i2]Hamid Saber, Homayoon Hatami, Jung Hyun Bae:
List Autoencoder: Towards Deep Learning Based Reliable Transmission Over Noisy Channels. CoRR abs/2112.11920 (2021) - 2020
- [j2]Homayoon Hatami, David G. M. Mitchell, Daniel J. Costello Jr., Thomas E. Fuja:
Performance Bounds and Estimates for Quantized LDPC Decoders. IEEE Trans. Commun. 68(2): 683-696 (2020) - [j1]Homayoon Hatami, David G. M. Mitchell, Daniel J. Costello Jr., Thomas E. Fuja:
A Threshold-Based Min-Sum Algorithm to Lower the Error Floors of Quantized LDPC Decoders. IEEE Trans. Commun. 68(4): 2005-2015 (2020)
2010 – 2019
- 2019
- [c4]Homayoon Hatami, David G. M. Mitchell, Daniel J. Costello Jr., Thomas E. Fuja:
A Modified Min-Sum Algorithm for Quantized LDPC Decoders. ISIT 2019: 2434-2438 - [i1]Homayoon Hatami, David G. M. Mitchell, Daniel J. Costello Jr., Thomas E. Fuja:
Performance Bounds and Estimates for Quantized LDPC Decoders. CoRR abs/1911.02762 (2019) - 2018
- [c3]Homayoon Hatami, David G. M. Mitchell, Daniel J. Costello Jr., Thomas E. Fuja:
Performance Bounds for Quantized Spatially Coupled LDPC Decoders Based on Absorbing Sets. ISIT 2018: 826-830 - 2017
- [c2]Homayoon Hatami, David G. M. Mitchell, Daniel J. Costello Jr., Thomas E. Fuja:
Lower bounds for quantized LDPC min-sum decoders based on absorbing sets. Allerton 2017: 694-699 - 2016
- [c1]Homayoon Hatami, David G. M. Mitchell, Daniel J. Costello Jr., Thomas E. Fuja:
Performance bounds for quantized LDPC decoders based on absorbing sets. ISIT 2016: 2539-2543
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 2024-04-25 05:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint