Publication | Closed Access
A Trellis-Based Method for Removing Cycles From Bipartite Graphs and Construction of Low Density Parity Check Codes
28
Citations
7
References
2004
Year
Trellis-based Iterative MethodEngineeringGraph TheoryAlgebraic Graph TheoryStructural Graph TheoryComputer EngineeringIterative DecodingTrellis-based MethodComputational ComplexityShort CyclesCombinatorial Design TheoryComputer ScienceDiscrete MathematicsBipartite GraphsError Correction CodeGraph Algorithm
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1