Efficient Encoder Structures for Non-Binary Cycle Codes

Low-density parity-check codes with variable node degree two over high order Galois fields, also called non-binary cycle codes, exhibit good error correction performance. In this paper, several efficient encoder structures are proposed for non-binary cycle codes with only one optimized group of non-zero entries in GF(q)(q > 2). The computation complexity and storage requirement are compared for these methods. Considering the underlying sparse graph of cycle code, the encoding complexity is quite low with the proposed modifications. In this way, a proper tradeoff between complexity and performance is achieved for non-binary cycle codes.