We analyze the relation between iterative decoding and 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 the parameters of the code. By developing a tree of codewords at minimal distance from the received vector, we also obtain new information about the code.
|Title of host publication||Proceedings of Information Theory Workshop on Coding and Complexity|
|Publication status||Published - 2005|
|Event||IEEE Information Theory Society : Information Theory Workshop 2005 on Coding and Complexity - Roturua, New Zealand|
Duration: 1 Jan 2005 → …
|Conference||IEEE Information Theory Society : Information Theory Workshop 2005 on Coding and Complexity|
|City||Roturua, New Zealand|
|Period||01/01/2005 → …|