Showing cs.ITShow all
2 papers · 1 filter
cs.IT2007
On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes
Andrew McGregor, Olgica Milenkovic
We prove that approximating the size of stopping and trapping sets in Tanner graphs of linear block codes, and more restrictively, the class of low-density parity-check (LDPC) code…
cs.IT2007
Permutation Decoding and the Stopping Redundancy Hierarchy of Linear Block Codes
Thorsten Hehn, Olgica Milenkovic, Stefan Laendner +1
We investigate the stopping redundancy hierarchy of linear block codes and its connection to permutation decoding techniques. An element in the ordered list of stopping redundancy…