default search action
Reza Asvadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Tad Matsumoto, Amin Zribi, Reza Asvadi, Elsa Dupraz, Wensheng Lin:
Two-Stage Successive Wyner-Ziv Lossy Forward Relaying for Lossy Communications: Rate-Distortion and Outage Probability Analyses. IEEE Trans. Veh. Technol. 73(8): 11394-11410 (2024) - [c11]Elsa Dupraz, Ismaila Salihou Adamou, Reza Asvadi, Tad Matsumoto:
Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing. ISIT 2024: 2915-2920 - [i13]Elsa Dupraz, Ismaila Salihou Adamou, Reza Asvadi, Tad Matsumoto:
Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing. CoRR abs/2405.07697 (2024) - [i12]Fatemeh Khaledian, Reza Asvadi, Elsa Dupraz, Tad Matsumoto:
Covering Codes as Near-Optimal Quantizers for Distributed Testing Against Independence. CoRR abs/2410.15839 (2024) - 2023
- [j16]Hossein Shahverdi, Mohammad Nabati, Parisa Fard Moshiri, Reza Asvadi, Seyed Ali Ghorashi:
Enhancing CSI-Based Human Activity Recognition by Edge Detection Techniques. Inf. 14(7): 404 (2023) - [j15]Mahnaz Chahoushi, Mohammad Nabati, Reza Asvadi, Seyed Ali Ghorashi:
CSI-Based Human Activity Recognition Using Multi-Input Multi-Output Autoencoder and Fine-Tuning. Sensors 23(7): 3591 (2023) - [j14]Aria Nouri, Reza Asvadi, Jun Chen, Pascal O. Vontobel:
Constrained Secrecy Capacity of Finite-Input Intersymbol Interference Wiretap Channels. IEEE Trans. Commun. 71(6): 3301-3316 (2023) - 2022
- [j13]Kamal Ziadi, Reza Asvadi:
A Device-to-Device direct discovery algorithm to mitigate the collision caused by hidden users. Phys. Commun. 52: 101608 (2022) - [c10]Aria Nouri, Reza Asvadi:
Matched Information Rate Codes for Binary-Input Intersymbol Interference Wiretap Channels. ISIT 2022: 1052-1057 - 2021
- [c9]Aria Nouri, Reza Asvadi, Jun Chen, Pascal O. Vontobel:
Finite-Input Intersymbol Interference Wiretap Channels. ITW 2021: 1-6 - [c8]Golshan Piroozzadeh, Reza Asvadi:
Application and Analysis of Expectation Propagation Algorithm in the Binary Erasure Quantization. IWCIT 2021: 1-6 - [i11]Aria Nouri, Reza Asvadi, Jun Chen, Pascal O. Vontobel:
Constrained Secrecy Capacity of Partial-Response Wiretap Channels. CoRR abs/2102.04941 (2021) - 2020
- [j12]Salma Kazemi Rashed, Reza Asvadi, Siavash Rajabi, Seyed Ali Ghorashi, Maria G. Martini:
Power Allocation for D2D Communications Using Max-Min Message-Passing Algorithm. IEEE Trans. Veh. Technol. 69(8): 8443-8458 (2020)
2010 – 2019
- 2019
- [j11]Mahdi Nangir, Reza Asvadi, Jun Chen, Mahmoud Ahmadian-Attari, Tad Matsumoto:
Successive Wyner-Ziv Coding for the Binary CEO Problem Under Logarithmic Loss. IEEE Trans. Commun. 67(11): 7512-7525 (2019) - 2018
- [j10]Mahdi Nangir, Mahmoud Ahmadian-Attari, Reza Asvadi:
Binary Wyner-Ziv code design based on compound LDGM-LDPC structures. IET Commun. 12(4): 375-383 (2018) - [j9]Sahar Shahbaz, Bahareh Akhbari, Reza Asvadi:
LDPC codes over Gaussian multiple access wiretap channel. IET Commun. 12(8): 962-969 (2018) - [j8]Mohamad Khas, Hamid Saeedi, Reza Asvadi:
Design and analysis of LDPC codes for joint source-channel decoding of two correlated sensors. IET Commun. 12(8): 1003-1010 (2018) - [j7]Mahdi Nangir, Reza Asvadi, Mahmoud Ahmadian-Attari, Jun Chen:
Analysis and Code Design for the Binary CEO Problem Under Logarithmic Loss. IEEE Trans. Commun. 66(12): 6003-6014 (2018) - [i10]Mahdi Nangir, Reza Asvadi, Mahmoud Ahmadian-Attari, Jun Chen:
Analysis and Code Design for the Binary CEO Problem under Logarithmic Loss. CoRR abs/1801.00435 (2018) - [i9]Mahdi Nangir, Reza Asvadi, Mahmoud Ahmadian-Attari, Jun Chen:
Binary CEO Problem under Log-Loss with BSC Test-Channel Model. CoRR abs/1801.02976 (2018) - [i8]Sahar Shahbaz, Bahareh Akhbari, Reza Asvadi:
LDPC Codes over Gaussian Multiple Access Wiretap Channel. CoRR abs/1801.04420 (2018) - [i7]Mahdi Nangir, Reza Asvadi, Mahmoud Ahmadian-Attari, Jun Chen:
Successive Wyner-Ziv Coding for the Binary CEO Problem under Log-Loss. CoRR abs/1803.02605 (2018) - [i6]Mahdi Nangir, Reza Asvadi, Jun Chen, Mahmoud Ahmadian-Attari, Tad Matsumoto:
Successive Wyner-Ziv Coding for the Binary CEO Problem under Logarithmic Loss. CoRR abs/1812.11584 (2018) - 2017
- [c7]Mohamad Khas, Hamid Saeedi, Reza Asvadi:
LDPC code design for correlated sources using EXIT charts. ISIT 2017: 2945-2949 - [i5]Mohamad Khas Mohamadi, Hamid Saeedi, Reza Asvadi:
Design of Capacity Approaching Ensembles of LDPC Codes for Correlated Sources using EXIT Charts. CoRR abs/1701.08067 (2017) - 2016
- [j6]Sara Khosravi, Reza Asvadi, Mahmoud Ahmadian-Attari:
An Efficient Algorithm to Improve the Success Threshold of Node-Based Verification-Based Algorithms in Compressed Sensing. IEEE Commun. Lett. 20(8): 1487-1490 (2016) - 2014
- [c6]Reza Asvadi, Tad Matsumoto, Markku J. Juntti:
LDPC code optimization with joint source-channel decoding of quantized Gauss-Markov signals. ICC 2014: 5233-5238 - 2013
- [j5]Reza Asvadi, Amir H. Banihashemi:
A Rate-Compatible Puncturing Scheme for Finite-Length LDPC Codes. IEEE Commun. Lett. 17(1): 147-150 (2013) - [c5]Reza Asvadi, Tad Matsumoto, Markku J. Juntti:
Joint distributed source-channel decoding for LDPC-coded binary Markov sources. PIMRC 2013: 807-811 - [i4]Reza Asvadi, Tad Matsumoto, Markku J. Juntti:
Joint Distributed Source-Channel Decoding for LDPC-Coded Binary Markov Sources. CoRR abs/1308.0120 (2013) - 2012
- [j4]Sina Khazraie, Reza Asvadi, Amir H. Banihashemi:
A PEG Construction of Finite-Length LDPC Codes with Low Error Floor. IEEE Commun. Lett. 16(8): 1288-1291 (2012) - [j3]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari:
Design of Finite-Length Irregular Protograph Codes with Low Error Floors over the Binary-Input AWGN Channel Using Cyclic Liftings. IEEE Trans. Commun. 60(4): 902-907 (2012) - [j2]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari, Hamid Saeedi:
LLR Approximation for Wireless Channels Based on Taylor Series and its Application to BICM With LDPC Codes. IEEE Trans. Commun. 60(5): 1226-1236 (2012) - 2011
- [j1]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari:
Lowering the Error Floor of LDPC Codes Using Cyclic Liftings. IEEE Trans. Inf. Theory 57(4): 2213-2224 (2011) - [c4]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari, Hamid Saeedi:
LLR Approximation for Wireless Channels Based on Taylor Series and Its Application to BICM with LDPC Codes. GLOBECOM 2011: 1-6 - [c3]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari:
Design of irregular quasi-cyclic protograph codes with low error floors. ISIT 2011: 908-912 - [i3]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari:
Design of Finite-Length Irregular Protograph Codes with Low Error Floors over the Binary-Input AWGN Channel Using Cyclic Liftings. CoRR abs/1102.0424 (2011) - [i2]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari, Hamid Saeedi:
LLR Approximation for Wireless Channels Based on Taylor Series and Its Application to BICM with LDPC Codes. CoRR abs/1103.2607 (2011) - 2010
- [c2]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari:
Approximation of Log-Likelihood Ratio for Wireless Channels Based on Taylor Series. GLOBECOM 2010: 1-5 - [c1]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari:
Lowering the error floor of LDPC codes using cyclic liftings. ISIT 2010: 724-728 - [i1]Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari:
Lowering the Error Floor of LDPC Codes Using Cyclic Liftings. CoRR abs/1002.4311 (2010)
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-11-27 21:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint