| CPC G06F 11/085 (2013.01) [H03M 13/11 (2013.01); H03M 13/15 (2013.01); H03M 13/611 (2013.01); H03M 13/6561 (2013.01); H04L 1/0041 (2013.01); H04L 1/0057 (2013.01); H03M 13/09 (2013.01); H03M 13/152 (2013.01); H03M 13/17 (2013.01)] | 27 Claims |

|
1. A method comprising:
generating, based on a first symbol sequence related to a first part of K payload symbols of a first cyclic code, a first parity sequence corresponding to the first symbol sequence, wherein K is an integer greater than 1;
generating, based on a second symbol sequence related to a second part of the K payload symbols, a second parity sequence corresponding to the second symbol sequence, wherein the first part is different from the second part; and
generating (N−K) parity symbols based on the first parity sequence and the second parity sequence,
wherein N is an integer greater than K.
|