Intersection of Hadamard Codes

  • Authors:
  • K. T. Phelps;M. Villanueva

  • Affiliations:
  • Dept. of Math. & Stat., Auburn Univ., AL;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2007

Quantified Score

Hi-index 754.90

Visualization

Abstract

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}