A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian Codes
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.