Published in

2007 IEEE International Symposium on Information Theory

DOI: 10.1109/isit.2007.4557408

Links

Tools

Export citation

Search in Google Scholar

A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian Codes

Journal article published in 2007 by Rachit Agarwal, Ralf Koetter, Emanuel M. Popovici
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

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.