Parallel and serial concatenated single parity check product codes

10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2005 Hindawi Publishing Corporation.

Cite

CITATION STYLE

APA

Rankin, D. M., Aaron Gulliver, T., & Taylor, D. P. (2005). Parallel and serial concatenated single parity check product codes. Eurasip Journal on Applied Signal Processing, 2005(6), 775–783. https://doi.org/10.1155/ASP.2005.775

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free