Iterative list decoding

We analyze the relation between iterative decoding and the properties of the extended parity check matrix. By considering a modified version of bit flipping, which produces a list of decoded words, we derive several relations between decodable error patterns and parameters of the code. By developing a tree of codewords at minimal distance form the received vector, we also obtain new information about the code.