Farzane Amirzade

Orcid: 0000-0002-8665-7921

Affiliations:
  • Amirkabir University of Technology (Tehran Polytechnic), Department of Mathematics and Computer Science, Tehran, Iran
  • Carleton University, School of Mathematics and Statistics, Ottawa, Canada


According to our database1, Farzane Amirzade authored at least 19 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Girth Analysis of Quantum Quasi-Cyclic LDPC Codes.
Probl. Inf. Transm., June, 2024

Construction of Protograph-Based LDPC Codes With Chordless Short Cycles.
IEEE Trans. Inf. Theory, January, 2024

Disjoint Difference Sets and QC-LDPC Codes With Girth 10.
Proceedings of the 12th Iran Workshop on Communication and Information Theory, 2024

2022
Improving Asymptotic Properties of Loop Construction of SC-LDPC Chains Over the BEC.
IEEE Commun. Lett., 2022

QC-LDPC Codes With Large Column Weight and Free of Small Size ETSs.
IEEE Commun. Lett., 2022

Trade-Based LDPC Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Protograph-based LDPC codes with chordless short cycles and large minimum distance.
Proceedings of the 17th Canadian Workshop on Information Theory, 2022

2021
Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes With Girth 6 and Shortest Length.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Reliability enhancement and packet loss recovery of any steganographic method in voice over IP.
Wirel. Networks, 2020

Edge-Coloring Technique to Analyze Elementary Trapping Sets of Spatially-Coupled LDPC Convolutional Codes.
IEEE Commun. Lett., 2020

QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field.
Adv. Math. Commun., 2020

2018
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., 2018

Analytical Lower Bound on the Lifting Degree of Multiple-Edge QC-LDPC Codes With Girth 6.
IEEE Commun. Lett., 2018

Edge Coloring Technique to Remove Small Elementary Trapping Sets from Tanner Graph of QC-LDPC Codes with Column Weight 4.
CoRR, 2018

Efficient Search of QC-LDPC Codes with Girths 6 and 8 and Free of Elementary Trapping Sets with Small Size.
CoRR, 2018

Lower Bounds on the Lifting Degree of QC-LDPC Codes by Difference Matrices.
IEEE Access, 2018

A Neural Network Lattice Decoding Algorithm.
Proceedings of the IEEE Information Theory Workshop, 2018

2017
Lower bounds on the lifting degree of single-edge and multiple-edge QC-LDPC codes by difference matrices.
CoRR, 2017

2012
Super-simple 2-(v, 5, 1) directed designs and their smallest defining sets.
Australas. J Comb., 2012


  Loading...