default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFarzane Amirzade 0001
Person information
- affiliation: Amirkabir University of Technology (Tehran Polytechnic), Department of Mathematics and Computer Science, Tehran, Iran
- affiliation: Carleton University, School of Mathematics and Statistics, Ottawa, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j11]Farzane Amirzade, Daniel Panario, Mohammad-Reza Sadeghi:
Girth Analysis of Quantum Quasi-Cyclic LDPC Codes. Probl. Inf. Transm. 60(2): 71-89 (2024)- [j10]Farzane Amirzade
, Mohammad-Reza Sadeghi, Daniel Panario:
Construction of Protograph-Based LDPC Codes With Chordless Short Cycles. IEEE Trans. Inf. Theory 70(1): 51-74 (2024) - 2022
- [j9]Alireza Eshraghi Dehaghani, Mohammad-Reza Sadeghi, Farzane Amirzade:
Improving Asymptotic Properties of Loop Construction of SC-LDPC Chains Over the BEC. IEEE Commun. Lett. 26(3): 495-499 (2022) - [j8]Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario:
QC-LDPC Codes With Large Column Weight and Free of Small Size ETSs. IEEE Commun. Lett. 26(3): 500-504 (2022) - 2020
- [j7]Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario:
QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field. Adv. Math. Commun. 14(3): 397-411 (2020) - [j6]Mohammad-Reza Sadeghi, Farzane Amirzade:
Edge-Coloring Technique to Analyze Elementary Trapping Sets of Spatially-Coupled LDPC Convolutional Codes. IEEE Commun. Lett. 24(4): 711-715 (2020) - [j5]Parvaneh Amirzade Dana, Zahra Esmaeilbeig, Mohammad-Reza Sadeghi:
Reliability enhancement and packet loss recovery of any steganographic method in voice over IP. Wirel. Networks 26(8): 5817-5823 (2020) - 2018
- [j4]Farzane Amirzade, Mohammad-Reza Sadeghi:
Lower Bounds on the Lifting Degree of QC-LDPC Codes by Difference Matrices. IEEE Access 6: 23688-23700 (2018) - [j3]Mohammad-Reza Sadeghi, Farzane Amirzade:
Analytical Lower Bound on the Lifting Degree of Multiple-Edge QC-LDPC Codes With Girth 6. IEEE Commun. Lett. 22(8): 1528-1531 (2018) - [j2]Farzane Amirzade, Mohammad-Reza Sadeghi:
Analytical Lower Bounds on the Size of Elementary Trapping Sets of Variable-Regular LDPC Codes With Any Girth and Irregular Ones With Girth 8. IEEE Trans. Commun. 66(6): 2313-2321 (2018) - 2012
- [j1]Farzane Amirzade, Nasrin Soltankhah:
Super-simple 2-(v, 5, 1) directed designs and their smallest defining sets. Australas. J Comb. 54: 85-106 (2012)
Conference and Workshop Papers
- 2024
- [c5]Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario:
Disjoint Difference Sets and QC-LDPC Codes With Girth 10. IWCIT 2024: 1-5 - 2022
- [c4]Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario:
Protograph-based LDPC codes with chordless short cycles and large minimum distance. CWIT 2022: 16-20 - [c3]Farzane Amirzade, Daniel Panario, Mohammad-Reza Sadeghi:
Trade-Based LDPC Codes. ISIT 2022: 542-547 - 2021
- [c2]Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario:
Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes With Girth 6 and Shortest Length. ISIT 2021: 368-373 - 2018
- [c1]Mohammad-Reza Sadeghi, Farzane Amirzade, Daniel Panario, Amin Sakzad:
A Neural Network Lattice Decoding Algorithm. ITW 2018: 1-5
Informal and Other Publications
- 2021
- [i7]Farzane Amirzade, Daniel Panario, Mohammad-Reza Sadeghi:
Trade-Based LDPC Codes. CoRR abs/2107.07466 (2021) - 2020
- [i6]Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario:
Construction of protograph-based LDPC codes with chordless short cycles. CoRR abs/2008.01322 (2020) - 2018
- [i5]Farzane Amirzade, Mohammad-Reza Sadeghi:
Efficient Search of QC-LDPC Codes with Girths 6 and 8 and Free of Elementary Trapping Sets with Small Size. CoRR abs/1803.08141 (2018) - [i4]Mohammad-Reza Sadeghi, Farzane Amirzade, Daniel Panario, Amin Sakzad:
A Neural Network Lattice Decoding Algorithm. CoRR abs/1807.02913 (2018) - [i3]Mohammad-Reza Sadeghi, Farzane Amirzade:
Edge Coloring Technique to Remove Small Elementary Trapping Sets from Tanner Graph of QC-LDPC Codes with Column Weight 4. CoRR abs/1808.05258 (2018) - 2017
- [i2]Farzane Amirzade, Mohammad-Reza Sadeghi:
Analytical lower bounds for the size of elementary trapping sets of variable-regular LDPC codes with any girth and irregular ones with girth 8. CoRR abs/1706.01703 (2017) - [i1]Farzane Amirzade, Mohammad-Reza Sadeghi:
Lower bounds on the lifting degree of single-edge and multiple-edge QC-LDPC codes by difference matrices. CoRR abs/1709.00825 (2017)
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 2025-01-21 00:17 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:
