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.
No takes yet. Share an insight, caveat, or question.
Lan et al. (2004) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: