DocumentCode :
818524
Title :
Intersection of Hadamard Codes
Author :
Phelps, Kevin T. ; Villanueva, Merce
Author_Institution :
Dept. of Math. & Stat., Auburn Univ., AL
Volume :
53
Issue :
5
fYear :
2007
fDate :
5/1/2007 12:00:00 AM
Firstpage :
1924
Lastpage :
1928
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}
Keywords :
Hadamard codes; Hadamard matrices; binary codes; Hadamard code; Hadamard matrix; binary code; intersection number; Algebra; Computer science; Cryptography; Error correction; Error correction codes; Galois fields; Geometry; Mathematics; Notice of Violation; Parameter estimation; Extended Hamming codes; Hadamard codes; Hadamard designs; Hadamard matrices; intersection number;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2007.894687
Filename :
4167750
Link To Document :
بازگشت