A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian Codes
Rachit Agarwal, R. Koetter, Emanuel Mihai Popovici · 2007
We present an algorithm for systematic encoding of Hermitian codes. For a Hermitian code defined overGF(q2), the proposed algorithm achieves a run time complexity ofO(q2) and is suitable for VLSI implementation. The encoder architecture uses as main blocksqvarying-rate Reed-Solomon encoders and achieves a space complexity ofO(q2) in terms of finite field multipliers and memory elements.