Optimized arithmetic for Reed-Solomon encoders
Christof Paar · 2002
Multiplication with constant elements from Galois fields GF(2/sup n/) is the major arithmetic operation in Reed-Solomon encoders. This contribution describes two optimization algorithms which yield low complexity constant multipliers.