Identifying High-Dimension Subspace Subcodes of Reed–Solomon Codes
Sarah Agnes Spence · IEEE Transactions on Information Theory · 2004
Subspace subcodes of Reed-Solomon (SSRS) codes were introduced by Hattori, McEliece, Solomo, and Lin in the mid-1990s. These authors found a complicated dimension formula and a simple, tight lower bound on the dimension of SSRS codes over F/sub 2//sup m/. We prove a conjecture of Hattori concerning how to identify subspaces that can be used to build SSRS codes whose dimension exceeds this lower bound.