By Topic

Intersection of Hadamard 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

2 Author(s)
Phelps, K.T. ; Dept. of Math. & Stat., Auburn Univ., AL ; Villanueva, M.

For two binary codes C1,C2, define i(C1 ,C2)=|C1capC2| to be their intersection number. This correspondence establishes that there exist Hadamard codes of length 2t, for all tges3, with intersection number i if and only if iisin{0,2,4,...,2t+1-12,2t+1-8,2t+1}. Also it is proved that for all tges4, if there exists a Hadamard matrix of order 4s, then there exist Hadamard codes of length 2t+2 s with intersection number i if and only if iisin{0,2,4,...,2 t+3s-12,2t+3s-8,2t+3s}

Published in:

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