From post

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.

 

Другие публикации лиц с тем же именем

On the semi-proper orientations of graphs.. CoRR, (2019)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, 12 (3): 243-261 (2020)On the Maximum Number of Non-attacking Rooks on a High-Dimensional Simplicial Chessboard., , и . Graphs Comb., 38 (3): 52 (2022)On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth., и . ITW, стр. 1-5. IEEE, (2019)On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles., и . IEEE Trans. Inf. Theory, 64 (6): 4438-4451 (2018)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, 65 (4): 2062-2074 (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, 65 (10): 6022-6043 (2019)Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles., и . ISTC, стр. 1-5. IEEE, (2018)Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random LDPC Code Ensembles., и . ISIT, стр. 1650-1654. IEEE, (2018)Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes., и . IEEE Trans. Inf. Theory, 65 (7): 4307-4315 (2019)