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

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

2007-04-04

arxiv.org/abs/0704.0590v2

Computer Science

Information Theory

5 Pages, Accepted in IEEE International Symposium on Information Theory ISIT 2007

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-213814