Efficient encoding of quasi-cyclic codes using shift registers

摘要

The application relates to the efficient encoding of quasi-cyclic codes. The parity-check matrix of a quasi-cyclic code is transformed by means of column permutations and elementary row operations into a plurality of parity-check matrices, each of which comprises two parts, wherein one part is the identity matrix. Encoding is performed by means of shift registers, which are defined by the remaining part of that transformed parity-check matrix that makes the complexity of the shift registers minimum. This could be achieved by e.g. selecting the transformed matrix having the minimum number of non-zero elements.