A Trellis-Based Method for Removing Cycles From Bipartite Graphs and Construction of Low Density Parity Check Codes
Longwen Lan, Ying Yu Tai, Lei Chen, Shu Lin, Khaled Abdel-Ghaffar · IEEE Communications Letters · 2004
This letter presents a trellis-based iterative method for removing short cycles from bipartite graphs. This method can be used to improve the performance of low density parity check (LDPC) codes or to construct new LDPC codes.