Suboptimal SISO decoding of systematic binary algebraic block codes

Previous work on concatenated single parity-check codes has yielded exceptionally good performance despite, or perhaps because of, their weak algebraic structure. In this article, maximum a posteriori single parity-check decoders are applied to the decoding of systematic binary algebraic block codes. Results for a range of Hamming codes show good performance compared to soft-decision brute force (maximum-likelihood) and algebraic decoding. The decoding complexity of the proposed technique grows only linearly with increasing block length.