default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArman Fazeli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Hanwen Yao
, Arman Fazeli, Alexander Vardy:
A Deterministic Algorithm for Computing the Weight Distribution of Polar Code. IEEE Trans. Inf. Theory 70(5): 3175-3189 (2024)- 2022
- [j9]Ido Tal, Henry D. Pfister, Arman Fazeli, Alexander Vardy:
Polar Codes for the Deletion Channel: Weak and Strong Polarization. IEEE Trans. Inf. Theory 68(4): 2239-2265 (2022) - [j8]Seyyed Ali Hashemi, Marco Mondelli, Arman Fazeli, Alexander Vardy, John M. Cioffi, Andrea Goldsmith:
Parallelism Versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes. IEEE Trans. Wirel. Commun. 21(6): 3909-3920 (2022) - [j7]Sharad Sambhwani, Zdravko Boos, Sidharth Dalmia, Arman Fazeli, Bertram Gunzelmann, Anatoliy Ioffe, Murali Narasimha, Francesco Negro, Laxminarayana S. Pillutla, John Zhou:
Transitioning to 6G Part 1: Radio Technologies. IEEE Wirel. Commun. 29(1): 6-8 (2022) - 2021
- [j6]Hanwen Yao, Arman Fazeli, Alexander Vardy:
List Decoding of Arıkan's PAC Codes. Entropy 23(7): 841 (2021) - [j5]Arman Fazeli, Hamed Hassani, Marco Mondelli, Alexander Vardy:
Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels. IEEE Trans. Inf. Theory 67(9): 5693-5710 (2021) - [j4]Kuangda Tian, Arman Fazeli, Alexander Vardy:
Polar Coding for Channels With Deletions. IEEE Trans. Inf. Theory 67(11): 7081-7095 (2021) - [c23]Bhaskar Gupta, Hanwen Yao, Arman Fazeli, Alexander Vardy:
Polar List Decoding for Large Polarization Kernels. GLOBECOM (Workshops) 2021: 1-6 - [c22]Yishen Yeh, Arman Fazeli, Paul H. Siegel:
Optimal Placement of Read Thresholds for Coded NAND Flash Memory. ICC 2021: 1-7 - [c21]Hanwen Yao, Arman Fazeli, Alexander Vardy:
A Deterministic Algorithm for Computing the Weight Distribution of Polar Codes. ISIT 2021: 1218-1223 - [c20]Arman Fazeli, Alexander Vardy, Hanwen Yao:
List Decoding of Polar Codes: How Large Should the List Be to Achieve ML Decoding? ISIT 2021: 1594-1599 - [c19]Hanwen Yao, Hessam Mahdavifar, Arman Fazeli, Alexander Vardy:
Channel Combining for Nonstationary Polarization on Erasure Channels. ISIT 2021: 1730-1735 - [c18]Seyyed Ali Hashemi, Marco Mondelli, Arman Fazeli, Alexander Vardy, John M. Cioffi, Andrea Goldsmith:
Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes. ISIT 2021: 2369-2374 - [i10]Hanwen Yao, Arman Fazeli, Alexander Vardy:
A Deterministic Algorithm for Computing the Weight Distribution of Polar Codes. CoRR abs/2102.07362 (2021) - 2020
- [c17]Hanwen Yao, Arman Fazeli, Alexander Vardy:
List Decoding of Arıkan's PAC Codes. ISIT 2020: 443-448 - [c16]Arman Fazeli, Alexander Vardy, Hanwen Yao:
Hardness of Successive-Cancellation Decoding of Linear Codes. ISIT 2020: 455-460 - [i9]Hanwen Yao, Arman Fazeli, Alexander Vardy:
List Decoding of Arikan's PAC Codes. CoRR abs/2005.13711 (2020) - [i8]Seyyed Ali Hashemi, Marco Mondelli, Arman Fazeli, Alexander Vardy, John M. Cioffi, Andrea Goldsmith:
Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes. CoRR abs/2012.13378 (2020)
2010 – 2019
- 2019
- [c15]Ido Tal, Henry D. Pfister, Arman Fazeli, Alexander Vardy:
Polar Codes for the Deletion Channel: Weak and Strong Polarization. ISIT 2019: 1362-1366 - [c14]Arman Fazeli, Alexander Vardy, Hanwen Yao:
Convolutional Decoding of Polar Codes. ISIT 2019: 1397-1401 - [c13]Hanwen Yao, Arman Fazeli, Alexander Vardy:
Explicit Polar Codes with Small Scaling Exponent. ISIT 2019: 1757-1761 - [i7]Hanwen Yao, Arman Fazeli, Alexander Vardy:
Explicit Polar Codes with Small Scaling Exponent. CoRR abs/1901.08186 (2019) - [i6]Ido Tal, Henry D. Pfister, Arman Fazeli, Alexander Vardy:
Polar Codes for the Deletion Channel: Weak and Strong Polarization. CoRR abs/1904.13385 (2019) - 2018
- [b1]Arman Fazeli Chaghooshi:
New Frontiers in Polar Coding: Large Kernels, Convolutional Decoding, and Deletion Channels. University of California, San Diego, USA, 2018 - [c12]Kuangda Tian, Arman Fazeli, Alexander Vardy:
Polar Coding for Deletion Channels: Theory and Implementation. ISIT 2018: 1869-1873 - [c11]Arman Fazeli, S. Hamed Hassani, Marco Mondelli, Alexander Vardy:
Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels. ITW 2018: 1-5 - 2017
- [j3]Sreechakra Goparaju, Arman Fazeli, Alexander Vardy:
Minimum Storage Regenerating Codes for All Parameters. IEEE Trans. Inf. Theory 63(10): 6318-6328 (2017) - [c10]Kuangda Tian, Arman Fazeli, Alexander Vardy, Rongke Liu:
Polar codes for channels with deletions. Allerton 2017: 572-579 - [c9]Arman Fazeli, Kuangda Tian, Alexander Vardy:
Viterbi-Aided Successive-Cancellation Decoding of Polar Codes. GLOBECOM 2017: 1-6 - [c8]Sarit Buzaglo, Arman Fazeli, Paul H. Siegel, Veeresh Taranalli, Alexander Vardy:
Permuted successive cancellation decoding for polar codes. ISIT 2017: 2618-2622 - [c7]Sarit Buzaglo, Arman Fazeli, Paul H. Siegel, Veeresh Taranalli, Alexander Vardy:
On Efficient Decoding of Polar Codes with Large Kernels. WCNC Workshops 2017: 1-6 - [i5]Arman Fazeli, S. Hamed Hassani, Marco Mondelli, Alexander Vardy:
Binary Linear Codes with Optimal Scaling and Quasi-Linear Complexity. CoRR abs/1711.01339 (2017) - 2016
- [c6]Arman Fazeli, Sreechakra Goparaju, Alexander Vardy:
Minimum storage regenerating codes for all parameters. ISIT 2016: 76-80 - [i4]Sreechakra Goparaju, Arman Fazeli, Alexander Vardy:
Minimum Storage Regenerating Codes For All Parameters. CoRR abs/1602.04496 (2016) - 2015
- [j2]Arman Fazeli, Alexander Vardy, Eitan Yaakobi:
Generalized Sphere Packing Bound. IEEE Trans. Inf. Theory 61(5): 2313-2334 (2015) - [c5]Arman Fazeli, Alexander Vardy, Eitan Yaakobi:
Codes for distributed PIR with low storage overhead. ISIT 2015: 2852-2856 - [i3]Arman Fazeli, Alexander Vardy, Eitan Yaakobi:
PIR with Low Storage Overhead: Coding instead of Replication. CoRR abs/1505.06241 (2015) - 2014
- [j1]Arman Fazeli, Shachar Lovett, Alexander Vardy:
Nontrivial t-designs over finite fields exist for all t. J. Comb. Theory A 127: 149-160 (2014) - [c4]Arman Fazeli, Alexander Vardy:
On the scaling exponent of binary polarization kernels. Allerton 2014: 797-804 - [c3]Arman Fazeli, Alexander Vardy, Eitan Yaakobi:
Generalized sphere packing bound: Basic principles. ISIT 2014: 1256-1260 - [c2]Arman Fazeli, Alexander Vardy, Eitan Yaakobi:
Generalized sphere packing bound: Applications. ISIT 2014: 1261-1265 - [i2]Arman Fazeli, Alexander Vardy, Eitan Yaakobi:
Generalized Sphere Packing Bound. CoRR abs/1401.6496 (2014) - 2013
- [c1]Zahra Shakeri, Arman Fazeli Chaghooshi, Mahtab Mirmohseni, Mohammad Reza Aref:
Degrees of freedom in a three-user cognitive interference channel. IWCIT 2013: 1-6 - [i1]Arman Fazeli, Shachar Lovett, Alexander Vardy:
Nontrivial t-designs over finite fields exist for all t. Electron. Colloquium Comput. Complex. TR13 (2013)
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-06-10 20:28 CEST 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:
