Counting short cycles of (c,d)-regular bipartite graphs

Mohsen Alinejad, Kazem Khashyarmanesh

Recently, working on the Tanner graph which represents a low density parity check (LDPC) code becomes an interesting research subject. Finding the number of short cycles of Tanner…