Optimization of LDPC Codes Using Convex Relaxation


• low density parity check (LDPC) codes are error correction codes • represented by two probability distributions λ and ρ • desired properties: – high code rate r ∈ R+ → fraction of redundancy present in the code – high noise threshold g ∈ R+ → the largest noise up to which the original code can be reconstructed from its noisy version without any loss of… (More)


  • Presentations referencing similar topics