Radosavljevic, B.Arikan, E.Hajek, B.2016-02-082016-02-081992189448http://hdl.handle.net/11693/26148Decoding algorithms are investigated in which unpruned codeword trees are generated from an ordered list of parity checks. 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. © 1992 IEEEEnglishAlgorithmsComputer simulationTrees (mathematics)Adaptive reorderingBinary erasure channelsDecoding algorithmsParity check codesSequential codingDecodingArticle10.1109/18.165462