Decoding algorithms in which unpruned codeword trees are generated from an ordered list of parity checks are investigated. The order is computed from the received message, and low-density parity-check codes are used to help control the growth of the tree. Simulation results are given for the binary erasure channel. They suggest that for the small erasure probability, the method is computationally feasible at rates above the computational cutoff rate. >
['Branko Radosavljevic', 'Erdal Arikan', 'Bruce E. Hajek']
Sequential decoding of low-density parity-check codes by adaptive reordering of parity checks