( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result.

, и . IEEE Trans. Commun., 68 (3): 1378-1390 (2020)

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.

Sara Banihashemi

Seyed Hashem Banihashemi

Manutschehr Amirfeyz

Iradj Amirzadeh-Asl

Mahmud Amirian-Khaffadjeh

 

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

Efficient Feedback-Based Scheduling Policies for Chunked Network Codes over Networks with Loss and Delay, и . CoRR, (2012)Deterministic Design of Low-Density Parity-Check Codes for Binary Erasure Channels, и . CoRR, (2008)Lower Bounds on the Size of Smallest Elementary and Non-Elementary Trapping Sets in Variable-Regular LDPC Codes., и . IEEE Communications Letters, 21 (9): 1905-1908 (2017)Network Codes with Overlapping Chunks over Line Networks: A Case for Linear-Time Codes, и . CoRR, (2011)Construction of QC-LDPC Codes with Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets., и . CoRR, (2019)Reliability-based schedule for decoding low-density parity-check codes., и . ICC, стр. 444-447. IEEE, (2004)On weighting/reweighting schemes for approximate message passing algorithms., , и . ICC, стр. 1-5. IEEE, (2016)On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth., и . ITW, стр. 1-5. IEEE, (2019)Design of irregular quasi-cyclic protograph codes with low error floors., , и . ISIT, стр. 908-912. IEEE, (2011)On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes., и . IEEE Trans. Inf. Theory, 60 (9): 5188-5203 (2014)