Answers are grounded in this paper and cite their sources.
This article presents a graph-theoretic method for constructing low-density parity-check (LDPC) codes from connected graphs without the requirement of large girth. This method is based on finding a set of paths in a connected graph, which satisfies the constraint that any two paths in the set are either disjoint or cross each other at one and only one vertex. Two trellis-based algorithms for finding these paths are devised. Good LDPC codes of practical lengths are constructed and they perform well with iterative decoding.
No takes yet. Share an insight, caveat, or question.
Djurdjevic et al. (2003) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: