For large integers K and N, what fraction of all binary error correcting codes of length N and rate R = K/N are linear codes? [The answer will depend on whether you choose to define the code to be an ordered list of 2^K code words, that is, a mapping from s ∈ {1, 2, . . . , 2^K} to x (s) , or to define the code to be an unordered list, so that two codes consisting of the same code words are identical. Use the latter definition: a code is a set of code words; how the encoder operates is not part of the definition of the code.]