By Topic

Identifying high-dimension subspace subcodes of Reed-Solomon codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Spence, S.A. ; Franklin W. Olin Coll. of Eng., Needham, MA, USA

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 F2m. 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.

Published in:

Information Theory, IEEE Transactions on  (Volume:50 ,  Issue: 6 )