By Topic

Some results related to generalized Varshamov-Gilbert bounds (Corresp.)

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

2 Author(s)

Two generalizations of the Varshamov-Gilbert bound for error-correcting and error-detecting codes are developed. Sufficient intrinsic conditions are given for classes of linear codes over GF (q) to include "good" codes, and these classes are related to other known classes. A lower bound on the maximal order of subspaces contained in subsets of certain finite vector spaces is given and related to a bound on error-detecting codes.

Published in:

Information Theory, IEEE Transactions on  (Volume:23 ,  Issue: 4 )