Today we’ll discuss the connection between the polynomial and matrix/vector points of view for GRS and RS codes, and begin to discuss encoding for this class of codes. We’ll also discuss how to write a GRS/RS code as a code over the prime field (or binary field) and what implications, good and bad, that has for their use.
Before our class meeting, you should use the resources below to be able to learn the following. You should be reasonably fluent with these; we’ll answer some questions on them in class but not reteach them in detail.
State and give examples of the definition of generalized Reed-Solomon (GRS) codes, code locators, column multipliers, primitive GRS code, normalized GRS code, narrow-sense GRS code, (singly) extended GRS code
