TY - CHAP
T1 - A low complexity algorithm and architecture for systematic encoding of Hermitian codes
AU - Agarwal, Rachit
AU - Koetter, Ralf
AU - Popovici, Emanuel M.
PY - 2007
Y1 - 2007
N2 - We present an algorithm for systematic encoding of Hermitian codes. For a Hermitian code defined over GF(q2), the proposed algorithm achieves a run time complexity of O(q2) 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(q2) in terms of finite field multipliers and memory elements.
AB - We present an algorithm for systematic encoding of Hermitian codes. For a Hermitian code defined over GF(q2), the proposed algorithm achieves a run time complexity of O(q2) 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(q2) in terms of finite field multipliers and memory elements.
UR - https://www.scopus.com/pages/publications/51649104067
U2 - 10.1109/ISIT.2007.4557408
DO - 10.1109/ISIT.2007.4557408
M3 - Chapter
AN - SCOPUS:51649104067
SN - 1424414296
SN - 9781424414291
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1336
EP - 1340
BT - Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
T2 - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Y2 - 24 June 2007 through 29 June 2007
ER -