Segmented Reverse Concatenation: A New Approach to Constrained ECC

In this work, a new coding scheme called segmented reverse concatenation is described, which generates constrained codes that can also correct a prescribed number of errors. Our codes are based upon the generalized reverse concatenation method; however, the key difference between our scheme and prior art is that in our scheme the redundancy symbols of the code are able to be partitioned into disjoint segments, each of which requires only a single parity bit to maintain the minimum distance of the code. We consider three potential applications of the new technique, and it is shown that in all three cases our approach improves upon prior art. Our scheme can be applied to many setups, although it is particularly well-suited for scenarios where the constrained encoder has a high information rate.