Subspace subcodes of Reed-Solomon codes

In this paper me introduce a class of nonlinear cyclic error-correcting codes, which me call subspace subcodes of Reed-Solomon (SSRS) codes. An SSRS code is a subset of a parent Reed-Solomon (RS) code consisting of the RS codewords whose components all lie in a fixed v-dimensional vector subspace S of GF (2(m)). SSRS codes are constructed using properties of the Galois field GF (2(m)). They are not linear over the field GF(2(nu)), which does not come into play, but rather are Abelian group codes over S. However, they are linear over GF(2), and the symbol-wise cyclic shift of any codeword is also a codeword. Our main result is an explicit but complicated formula for the dimension of an SSRS code. It implies a simple lower bound, which gives the true value of the dimension for most, though not all, subspaces.We also prove several important duality properties, We present some numerical examples, which show, among other things, that 1) SSRS codes can have a higher dimension than comparable subfield subcodes of RS codes, so that even if GF(2(nu)) is a subfield of GF (2(m)), it may not be the best nu-dimensional subspace for constructing SSRS codes; and 2) many high-rate SSRS codes have larger dimension than any previously known code with the same values of n, d, and q, including algebraic-geometry codes.These examples suggest that high-rate SSRS codes are promising candidates to replate Reed-Solomon codes in high-performance transmission and storage systems.