A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian Codes
- 1 June 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1336-1340
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.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- A Serial-In–Serial-Out Hardware Architecture for Systematic Encoding of Hermitian Codes via GrÖbner BasesIEEE Transactions on Communications, 2004
- A combined Reed-Solomon encoder and syndrome generator with small hardware complexity2003
- Performance comparison of Hermitian and Reed-Solomon codes2002
- On the structure of Hermitian codesJournal of Pure and Applied Algebra, 1997
- Systematic encoding via Grobner bases for a class of algebraic-geometric Goppa codesIEEE Transactions on Information Theory, 1995
- Hermitian codes as generalized Reed-Solomon codesDesigns, Codes and Cryptography, 1992
- Generalized Reed - Solomon codes from algebraic geometryIEEE Transactions on Information Theory, 1987