Author of the publication

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.

 

Other publications of authors with the same name

Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes., and . IEEE Communications Letters, 22 (1): 33-36 (2018)Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles., and . CoRR, (2019)Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is Hard., and . ISIT, page 1645-1649. IEEE, (2018)On the girth of quasi cyclic protograph LDPC codes., and . ISIT, page 3078-3082. IEEE, (2012)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., and . ISIT, page 1640-1644. IEEE, (2018)On construction of rate-compatible low-density parity-check codes., and . ICC, page 430-434. IEEE, (2004)Lowering the error floor of LDPC codes using cyclic liftings., , and . ISIT, page 724-728. IEEE, (2010)Comparison between continuous-time asynchronous and discrete-time synchronous iterative decoding., and . GLOBECOM, page 356-360. IEEE, (2004)On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph., and . IEEE Trans. Inf. Theory, 65 (6): 3778-3789 (2019)Corrections to Ön Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes"., and . IEEE Trans. Inf. Theory, 61 (3): 1508 (2015)