DocumentCode :
933785
Title :
On t-constant codes and designs (Corresp.)
Author :
Roos, Cornelis
Volume :
27
Issue :
5
fYear :
1981
fDate :
9/1/1981 12:00:00 AM
Firstpage :
640
Lastpage :
643
Abstract :
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 .
Keywords :
Coding; Matrices; Polynomials; Terminology;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1981.1056406
Filename :
1056406
Link To Document :
بازگشت