Login / Signup

Improved minimum weight, girth, and ACE distributions in ensembles of short block length irregular LDPC codes constructed using PEG and cyclic PEG (CPEG) algorithms.

Umar-Faruk Abdu-AguyeMarcel Adrian AmbrozeMartin Tomlinson
Published in: ISTC (2016)
Keyphrases
  • minimum weight
  • ldpc codes
  • computational complexity
  • image segmentation
  • minimum spanning tree
  • data structure
  • lower bound
  • worst case
  • optimization problems
  • natural images
  • bipartite graph
  • greedy heuristic