default search action
Farzad Parvaresh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j29]Zeinab Roostaie
, Mohammad Gholami
Four-Cycle Free Spatially Coupled LDPC Codes With an Explicit Construction. IEEE Commun. Lett. 28(7): 1479-1483 (2024) - [j28]HamidReza Farrokhniya
High Impedance Faults Detection in Distribution Systems Using Signal Correlations. IEEE Trans. Instrum. Meas. 73: 1-9 (2024) - [j27]Elahe Javadi, Zolfa Zeinalpour-Yazdi
Hierarchical coded caching with heterogeneous cache sizes. Wirel. Networks 30(4): 2001-2016 (2024) - [i10]Farzad Parvaresh, Reza Sobhani, Alireza Abdollahi, Javad Bagherian, Fatemeh Jafari, Maryam Khatami:
Improved bounds on the size of permutation codes under Kendall τ-metric. CoRR abs/2406.06029 (2024) - 2023
- [j26]Alireza Abdollahi, Javad Bagherian, Fatemeh Jafari, Maryam Khatami
New upper bounds on the size of permutation codes under Kendall τ-metric. Cryptogr. Commun. 15(5): 891-903 (2023) - [j25]Tuvi Etzion, Paul H. Siegel
Dimensions of Channel Coding: From Theory to Algorithms to Applications. IEEE J. Sel. Areas Inf. Theory 4: v-xiii (2023) - [j24]Sina Jorjani
On the diversity-multiplexing trade-off of hybrid diamond relay channels. Phys. Commun. 60: 102130 (2023) - [i9]Zeinab Roostaie, Mohammad Gholami, Farzad Parvaresh:
4-Cycle Free Spatially Coupled LDPC Codes with an Explicit Construction. CoRR abs/2310.12657 (2023) - 2022
- [c17]Alireza Abdollahi, Javad Bagherian, Fatemeh Jafari, Maryam Khatami
New table of Bounds on Permutation Codes under Kendall τ-Metric. IWCIT 2022: 1-3 - 2021
- [j23]Hasan Khayatian
DMT analysis and optimal scheduling for FSO relaying communications. IET Commun. 15(14): 1808-1820 (2021) - [j22]Hasan Khayatian
DMT analysis and optimal scheduling for two-hop parallel relay networks. Phys. Commun. 46: 101291 (2021) - [j21]Bentolhoda Alinezhad Seyyedmahalleh, S. Mohammad Saberali
ECF-Based Estimator for the LOS Power in Uplink NOMA System With Unknown Impulsive Noise. IEEE Signal Process. Lett. 28: 1868-1872 (2021) - [j20]Bentolhoda Alinezhad Seyyedmahalleh, S. Mohammad Saberali
On the performance of ECF-based multi-threshold receiver in NOMA systems for vehicular communications with unknown impulsive noise. Veh. Commun. 29: 100331 (2021) - [c16]Sahar Z. Poor, Amir R. Forouzan
A New Probabilistic Constellation Shaping Scheme for APSK Modulation. IWCIT 2021: 1-4 - 2020
- [j19]Mahdi Jafari Siavoshani
Coded Load Balancing in Cache Networks. IEEE Trans. Parallel Distributed Syst. 31(2): 347-358 (2020) - [j18]Hasan Khayatian
On optimal relaying strategies for VANETs over double Nakagami-m fading channels. Wirel. Networks 26(5): 3521-3537 (2020)
2010 – 2019
- 2019
- [j17]Iman Valiulahi
Eliminating Impulsive Noise in Pilot-Aided OFDM Channels via Dual of Penalized Atomic Norm. IEEE Commun. Lett. 23(11): 2059-2062 (2019) - [j16]Somayeh Sheikhzadeh
Tomlinson-Harashima precoding for transmitter-side inter-symbol interference cancellation in PSK modulation. IET Commun. 13(5): 610-619 (2019) - [j15]Mahdi Nouri, Mohsen Mivehchy, Farzad Parvaresh, Mohamad Farzan Sabahi
Target recognition and discrimination based on multiple-frequencies LFM signal with subcarrier hopping. Multidimens. Syst. Signal Process. 30(1): 93-117 (2019) - [j14]Iman Taghavi
High Resolution Compressed Sensing Radar Using Difference Set Codes. IEEE Trans. Signal Process. 67(1): 136-148 (2019) - [j13]Iman Valiulahi, Sajad Daei
Two-Dimensional Super-Resolution via Convex Relaxation. IEEE Trans. Signal Process. 67(13): 3372-3382 (2019) - [j12]Elahe Javadi, Zolfa Zeinalpour-Yazdi
Decentralized Hierarchical Coded Caching Over Heterogeneous Wireless Networks with Multi-level Popularity Content. Wirel. Pers. Commun. 107(4): 1973-1993 (2019) - [i8]Iman Valiulahi, Farzad Parvaresh, Ali Asghar Beheshti Shirazi:
Eliminating Impulsive Noise in Pilot-Aided OFDM Channels via Dual of Penalized Atomic Norm. CoRR abs/1908.07729 (2019) - 2018
- [j11]Babak Jafarpisheh
Phasor Estimation Algorithm Based on Complex Frequency Filters for Digital Relaying. IEEE Trans. Instrum. Meas. 67(3): 582-592 (2018) - [j10]Babak Jafarpisheh
Power System Frequency Estimation Using Adaptive Accelerated MUSIC. IEEE Trans. Instrum. Meas. 67(11): 2592-2602 (2018) - 2017
- [j9]Farzad Parvaresh
Diversity-Multiplexing Trade-Off of Half-Duplex Single Relay Networks. IEEE Trans. Inf. Theory 63(3): 1703-1720 (2017) - [j8]Fatemeh Rahimzadeh, Kamal Shahtalebi, Farzad Parvaresh:
Using NLMS Algorithms in Cyclostationary-Based Spectrum Sensing for Cognitive Radio Networks. Wirel. Pers. Commun. 97(2): 2781-2797 (2017) - [i7]Mahdi Jafari Siavoshani, Farzad Parvaresh, Ali Pourmiri, Seyed Pooya Shariatpanahi:
Coded Load Balancing in Cache Networks. CoRR abs/1707.09757 (2017) - [i6]Iman Valiulahi, Sajad Daei, Farzan Haddadi, Farzad Parvaresh:
Two-Dimensional Super-Resolution via Convex Relaxation. CoRR abs/1711.08239 (2017) - 2016
- [c15]Hediyeh Soltanizadeh, Farzad Parvaresh, S. Mohammad Saberali:
Computing diversity-multiplexing trade-off of static QMF communication strategy in half-duplex diamond relay channels. IST 2016: 368-373 - 2015
- [c14]Hediyeh Soltanizadeh, Farzad Parvaresh:
On the suboptimality of DDF and static QMF communication strategies in half-duplex single relay networks. IWCIT 2015: 1-6 - 2014
- [j7]Ilan Shomorony, Raúl H. Etkin, Farzad Parvaresh, Amir Salman Avestimehr:
Diamond Networks With Bursty Traffic: Bounds on the Minimum Energy-Per-Bit. IEEE Trans. Inf. Theory 60(1): 461-493 (2014) - [j6]Farzad Parvaresh, Raúl Hernán Etkin:
Efficient Capacity Computation and Power Optimization for Relay Networks. IEEE Trans. Inf. Theory 60(3): 1782-1792 (2014) - [j5]Raúl H. Etkin, Farzad Parvaresh, Ilan Shomorony, Amir Salman Avestimehr:
Computing Half-Duplex Schedules in Gaussian Relay Networks via Min-Cut Approximations. IEEE Trans. Inf. Theory 60(11): 7204-7220 (2014) - [c13]Mohsen Shabanian Borujeni, Farzad Parvaresh:
Phase retrieval of sparse L-ary signals from magnitudes of their Fourier transform. IWCIT 2014: 1-5 - 2013
- [j4]Farzad Parvaresh, Raúl H. Etkin:
Using Superposition Codebooks and Partial Decode-and-Forward in Low-SNR Parallel Relay Networks. IEEE Trans. Inf. Theory 59(3): 1704-1723 (2013) - [c12]Raúl H. Etkin, Farzad Parvaresh, Ilan Shomorony, Amir Salman Avestimehr:
On efficient min-cut approximations in half-duplex relay networks. ISIT 2013: 1949-1953 - [c11]Farzad Parvaresh, Raúl H. Etkin, Ilan Shomorony, Amir Salman Avestimehr:
On computing half-duplex relaying capacity in networks with orthogonal channels. IWCIT 2013: 1-6 - [i5]Raúl H. Etkin, Farzad Parvaresh, Ilan Shomorony, Amir Salman Avestimehr:
On Min-Cut Algorithms for Half-Duplex Relay Networks. CoRR abs/1305.2548 (2013) - 2012
- [j3]Erik Ordentlich, Farzad Parvaresh, Ron M. Roth:
Asymptotic Enumeration of Binary Matrices with Bounded Row and Column Sums. SIAM J. Discret. Math. 26(4): 1550-1575 (2012) - [c10]Farzad Parvaresh, Pascal O. Vontobel:
Approximately counting the number of constrained arrays via the sum-product algorithm. ISIT 2012: 279-283 - [c9]Ilan Shomorony, Raúl H. Etkin, Farzad Parvaresh, Amir Salman Avestimehr:
Bounds on the minimum energy-per-bit for bursty traffic in diamond networks. ISIT 2012: 801-805 - [c8]Farzad Parvaresh, Raúl H. Etkin:
Superposition of binary and Gaussian codebooks to relay data in diamond networks. ISIT 2012: 940-944 - [i4]Farzad Parvaresh, Raúl H. Etkin:
Using Superposition Codebooks and Partial Decode and Forward in Low SNR Parallel Relay Networks. CoRR abs/1205.3225 (2012) - [i3]Ilan Shomorony, Raúl H. Etkin, Farzad Parvaresh, Amir Salman Avestimehr:
Diamond Networks with Bursty Traffic: Bounds on the Minimum Energy-Per-Bit. CoRR abs/1205.6186 (2012) - 2011
- [c7]Erik Ordentlich, Farzad Parvaresh, Ron M. Roth:
Asymptotic enumeration of binary matrices with bounded row and column weights. ISIT 2011: 154-158 - [c6]Farzad Parvaresh, Raúl H. Etkin:
On computing the capacity of relay networks in polynomial time. ISIT 2011: 1342-1346 - [i2]Farzad Parvaresh, Raúl H. Etkin:
Efficient Capacity Computation and Power Optimization for Relay Networks. CoRR abs/1111.4244 (2011)
2000 – 2009
- 2009
- [j2]Mihailo Stojnic, Farzad Parvaresh, Babak Hassibi:
On the reconstruction of block-sparse signals with an optimal number of measurements. IEEE Trans. Signal Process. 57(8): 3075-3085 (2009) - 2008
- [j1]Farzad Parvaresh, Haris Vikalo
Recovering Sparse Signals Using Sparse Measurement Matrices in Compressed DNA Microarrays. IEEE J. Sel. Top. Signal Process. 2(3): 275-285 (2008) - [c5]Haris Vikalo, Farzad Parvaresh, Sidhant Misra, Babak Hassibi:
Sparse measurements, compressed sampling, and DNA microarrays. ICASSP 2008: 581-584 - [c4]Farzad Parvaresh, Babak Hassibi:
Explicit measurements with almost optimal thresholds for compressed sensing. ICASSP 2008: 3853-3856 - [i1]Mihailo Stojnic, Farzad Parvaresh, Babak Hassibi:
On the reconstruction of block-sparse signals with an optimal number of measurements. CoRR abs/0804.0041 (2008) - 2007
- [b1]Farzad Parvaresh:
Algebraic list-decoding of error-correcting codes. University of California, San Diego, USA, 2007 - 2006
- [c3]Farzad Parvaresh, Mohammad H. Taghavi, Alexander Vardy
On the Performance of Multivariate Interpolation Decoding of Reed-Solomon Codes. ISIT 2006: 2027-2031 - 2005
- [c2]Farzad Parvaresh, Alexander Vardy
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time. FOCS 2005: 285-294 - 2004
- [c1]Farzad Parvaresh, Alexander Vardy:
Polynomial matrix-chain interpolation in sudan-type reed-solomon decoders. ISIT 2004: 386
Coauthor Index
aka: Raúl Hernán Etkin
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-14 00:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: