A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian Codes
arXiv:0704.0590 · doi:10.1109/ISIT.2007.4557408
Abstract
We present an algorithm for systematic encoding of Hermitian codes. For a Hermitian code defined over GF(q^2), the proposed algorithm achieves a run time complexity of O(q^2) and is suitable for VLSI implementation. The encoder architecture uses as main blocks q varying-rate Reed-Solomon encoders and achieves a space complexity of O(q^2) in terms of finite field multipliers and memory elements.
5 Pages, Accepted in IEEE International Symposium on Information Theory ISIT 2007