Ali Dehghan
Orcid: 0000-0002-1543-1124Affiliations:
- Carleton University, Canada
- Amirkabir University of Technology, Iran
According to our database1,
Ali Dehghan
authored at least 46 papers
between 2012 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on cg.aut.ac.ir
On csauthors.net:
Bibliography
2022
On the Maximum Number of Non-attacking Rooks on a High-Dimensional Simplicial Chessboard.
Graphs Comb., 2022
Proceedings of the IEEE International Symposium on Information Theory, 2022
2021
2020
On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix.
IEEE Trans. Inf. Theory, 2020
IEEE Trans. Inf. Theory, 2020
Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result.
IEEE Trans. Commun., 2020
Design and implementation of a ring oscillator-based physically unclonable function on field programmable gate array to enhance electronic security.
Int. J. Electron. Secur. Digit. Forensics, 2020
2019
Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes.
IEEE Trans. Inf. Theory, 2019
On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph.
IEEE Trans. Inf. Theory, 2019
From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes.
IEEE Trans. Inf. Theory, 2019
Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles.
IEEE Trans. Inf. Theory, 2019
Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles.
Graphs Comb., 2019
Discret. Math. Theor. Comput. Sci., 2019
From the Spectrum of the Adjacency Matrix to the Spectrum of Directed Edge Matrix: Counting Cycles of a Bipartite Graph Through a Simple Equation.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019
On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019
2018
On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles.
IEEE Trans. Inf. Theory, 2018
Discret. Math. Theor. Comput. Sci., 2018
On Computing the Multiplicity of Short Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph.
CoRR, 2018
On the algorithmic complexity of decomposing graphs into regular/irregular structures.
CoRR, 2018
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications.
Algorithmica, 2018
Proceedings of the 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, 2018
Computing the Asymptotic Expected Multiplicity of Elementary Trapping Sets (ETSs) in Random LDPC Code Ensembles.
Proceedings of the 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, 2018
Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles.
Proceedings of the 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, 2018
Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random LDPC Code Ensembles.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is Hard.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
From Cages to Trapping Sets: A New Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
2017
Algorithmic complexity of weakly semiregular partitioning and the representation number.
Theor. Comput. Sci., 2017
J. Comb. Optim., 2017
Discret. Appl. Math., 2017
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs.
Discret. Appl. Math., 2017
Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles.
CoRR, 2017
2016
Discret. Math. Theor. Comput. Sci., 2016
2015
Graphs Comb., 2015
2014
2013
A practical fault induction attack against an FPGA implementation of AES cryptosystem.
Proceedings of the 2013 World Congress on Internet Security, 2013
2012
Discret. Math., 2012
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number.
Discret. Appl. Math., 2012