Spatially Coupled Repeat-Accumulate Codes

In this paper we propose a new class of spatially coupled codes based on regular repeat-accumulate codes. We show that these codes have several advantages over spatially coupled regular low-density parity-check codes including simpler encoders and slightly higher code rates when the thresholds and decoding complexity (as measured by the Tanner graph edge density) are similar.