Cart (Loading....) | Create Account
Close category search window
 

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
$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)

LetCbe a binary code containing the zero word, with fundamental parametersd,s,d', ands, and lettbe a nonnegative integer such that the words of any fixed weight ofCform at-design, withtmaximal in this respect. It is shown thatt geq max(d-s',d'-s). Moreover, ifCcontains the all one word, thent geq d'- s+1and ifCis an even weight code thent geq d - s' + 1. Finally, the following inequality is derived:d'-s < d, provided thatd>2.

Published in:

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

Date of Publication:

Sep 1981

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.