VLSI architecture for a decoder for Hermitian codes
Michael E. O’Sullivan, S.P. Pope · 2002
Algebraic geometry (AG) codes have long been recognized as theoretically powerful nonbinary block codes which equal or exceed the power of Reed-Solomon codes. However, there is a question of whether implementation of AG decoders is too complex to be practical. In this paper, we present algorithmic and architectural results that demonstrate how powerful AG decoders can be built with reasonable complexity-on the same order of complexity as that commonly devoted to Reed-Solomon decoding, and well within the capabilities of modern CMOS integrated-circuit technology.