Patent Document ID: 20060212782
Application ID: 11082037
Patent Flag: 0

Claim One:
1. A method for encoding and decoding original messages in a high-rate erasure resilience coding application having a coded message space that is at least an order of magnitude larger than a number of original messages, the method comprising: performing high-rate Reed-Solomon erasure resilient code encoding and decoding operations using a scalar vector multiplication and addition technique; the scalar vector multiplication and addition technique further comprising: establishing a logarithm lookup table and an exponential lookup table in advance of the encoding and decoding operations; calculating a logarithm of alpha, α, corresponding to a scalar number, using the logarithm lookup table; calculating a logarithm of an element of a content vector, x i ; testing whether the element of the content vector, x i , is equal to zero; for zero x i ; performing nothing; for non-zero x i , calculating an exponential of a sum of log(α) and a logarithm of the element of the content vector, x i , using the exponential lookup table to generate an intermediate result; and generating an updated element of the update vector, y i , by adding on the Galois Field the intermediate result to a current element of the update vector, y i .