Sign in

A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes.

Lan LanYing Yu TaiLei ChenShu LinKhaled A. S. Abdel-Ghaffar
Published in: IEEE Commun. Lett. (2004)
Keyphrases
  • bipartite graph
  • np hard
  • dynamic programming
  • coding scheme
  • low complexity
  • error correction