TR2003-107

Iterative Decoding of Multi-step Majority Logic Decodable Codes
Citation: Fossorier, M.; Palanki, R.; Yedidia, J.S., "Iterative Decoding of Multi-Step Majority Logic Decodable Codes", International Symposium on Turbo Codes and Related Topics, September 2003 (Intl Symposium on Turbo Codes and Related Topics)
Date:August 2003
MERL Contact:Jonathan Yedidia

The performance of iterative decoding algorithms for multi-step majority logic decodable (MSMLD) codes of intermediate length is investigated. We introduce a new bit-flipping algorithm that is able to decode these codes nearly as well as a maximum likelihood decoder on the binary symmetric channel. MSMLD codes decoded using bit-flipping algorithms can out-perform comparable BCH codes decoded using standard algebraic decoding algorithms, at least for high bit flip rates (or low and moderate signal to noise ratios).

 Read the full technical report (PDF: 291.8 kB)