By Topic

On t-constant codes and designs (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
$33 $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)

Let C be a binary code containing the zero word, with fundamental parameters d,s,d' , and s , and let t be a nonnegative integer such that the words of any fixed weight of C form a t -design, with t maximal in this respect. It is shown that t \geq \max (d-s',d'-s) . Moreover, if C contains the all one word, then t \geq d'- s+1 and if C is an even weight code then t \geq d - s' + 1 . Finally, the following inequality is derived: d'-s < d , provided that d> 2 .

Published in:

IEEE Transactions on Information Theory  (Volume:27 ,  Issue: 5 )