“…Clearly any linearized polynomial defines a ‐linear map of , . If we define the product of linearized polynomials to be composition, and identify with , then we get a ring isomorphism (see, for example, ): Note that from this correspondence, we may say that a code is ‐linear if the corresponding set of linearized polynomials is closed under multiplication by . We can also move easily from linearized polynomials to vectors in , simply by evaluating a polynomial on a set of elements of , linearly independent over .…”