EURASIP Journal on Applied Signal Processing
Volume 2005 (2005), Issue 6, Pages 775-783
doi:10.1155/ASP.2005.775
Abstract
The parallel and serial concatenation of codes is well
established as a practical means of achieving excellent
performance. In this paper, we introduce the parallel and serial
concatenation of single parity-check (SPC) product codes. The
weight distribution of these codes is analyzed and the performance
is bounded. Simulation results confirm these bounds at high
signal-to-noise ratios. The performance of these codes (and some
variants) is shown to be quite good given the low decoding
complexity and reasonably short blocklengths.