Login / Signup

Lower bounds for quantized LDPC min-sum decoders based on absorbing sets.

Homayoon HatamiDavid G. M. MitchellDaniel J. Costello Jr.Thomas E. Fuja
Published in: Allerton (2017)
Keyphrases
  • min sum
  • lower bound
  • np hard
  • goal programming
  • upper bound
  • decoding algorithm
  • random walk
  • optimal solution
  • evolutionary algorithm
  • special case
  • worst case
  • higher order
  • linear programming
  • min cut