Parallel and serial concatenated single parity check product codes (Q2570489)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 2220356
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel and serial concatenated single parity check product codes |
scientific article; zbMATH DE number 2220356 |
Statements
Parallel and serial concatenated single parity check product codes (English)
0 references
28 October 2005
0 references
Summary: 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.
0 references
parallel and serial concatenation
0 references
single parity-check product codes
0 references
0.8651783466339111
0 references
0.8272422552108765
0 references
0.823275089263916
0 references
0.8045983910560608
0 references
0.8020356297492981
0 references
