Author of the publication

Lower Bounds on the Size of Smallest Elementary and Non-Elementary Trapping Sets in Variable-Regular LDPC Codes.

, and . IEEE Communications Letters, 21 (9): 1905-1908 (2017)

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

Lower Bounds on the Size of Smallest Elementary and Non-Elementary Trapping Sets in Variable-Regular LDPC Codes., and . IEEE Communications Letters, 21 (9): 1905-1908 (2017)Efficient Feedback-Based Scheduling Policies for Chunked Network Codes over Networks with Loss and Delay, and . CoRR, (2012)Deterministic Design of Low-Density Parity-Check Codes for Binary Erasure Channels, and . CoRR, (2008)Network Codes with Overlapping Chunks over Line Networks: A Case for Linear-Time Codes, and . CoRR, (2011)On weighting/reweighting schemes for approximate message passing algorithms., , and . ICC, page 1-5. IEEE, (2016)Reliability-based schedule for decoding low-density parity-check codes., and . ICC, page 444-447. IEEE, (2004)Design of irregular quasi-cyclic protograph codes with low error floors., , and . ISIT, page 908-912. IEEE, (2011)On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth., and . ITW, page 1-5. IEEE, (2019)On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles., and . IEEE Trans. Inf. Theory, 64 (6): 4438-4451 (2018)Lowering the Error Floor of LDPC Codes Using Cyclic Liftings., , and . IEEE Trans. Inf. Theory, 57 (4): 2213-2224 (2011)