A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian Codes
Information Theory
2016-11-17 v2 math.IT
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.
Cite
@article{arxiv.0704.0590,
title = {A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian Codes},
author = {Rachit Agarwal and Ralf Koetter and Emanuel Popovici},
journal= {arXiv preprint arXiv:0704.0590},
year = {2016}
}
Comments
5 Pages, Accepted in IEEE International Symposium on Information Theory ISIT 2007