( en | de | ru )

 

Disambiguation of "Dehghan, Ali"

Author of the publication

copydeleteadd this publication to your clipboard
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.

, and . IEEE Trans. Inf. Theory, 65 (4): 2062-2074 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Keyvan Dehghan

Bahram Dehghan

Jahangir Dehghan-Manshadi

ali

Ali Aassie Ali

 

Other publications of authors with the same name

On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles., and . CoRR, (2017)On the algorithmic complexity of decomposing graphs into regular/irregular structures., , , and . CoRR, (2018)Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result., and . IEEE Trans. Commun., 68 (3): 1378-1390 (2020)On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix., and . IEEE Trans. Inf. Theory, 66 (10): 6037-6047 (2020)The Effect of E-Service Quality on Football Fan Satisfaction and Fan Loyalty toward the Websites of Their Favorable Football Teams., , , , and . Int. J. E Bus. Res., 12 (1): 43-57 (2016)From the Spectrum of the Adjacency Matrix to the Spectrum of Directed Edge Matrix: Counting Cycles of a Bipartite Graph Through a Simple Equation., and . ITW, page 1-5. IEEE, (2019)On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs., and . Discret. Appl. Math., (2017)Algorithmic complexity of proper labeling problems., , and . Theor. Comput. Sci., (2013)On the maximum number of non attacking rooks on a high-dimensional simplicial chessboard., , and . CoRR, (2021)Is there any polynomial upper bound for the universal labeling of graphs?, , and . J. Comb. Optim., 34 (3): 760-770 (2017)