Contents

Codes from Hadamard Matrices and Profiles of Hadamard Matrices

Cantian Lin1, Haiping Lin2, W. D. Wallis2, J. L. Yucas2
1Department of Mathematical Sciences University of Nevada Las Vegas, NV, 89154
2Department of Mathematics Southern Illinois University Carbondale, IL, 62901

Abstract

In this paper, we illustrate the relationship between profiles of Hadamard matrices and weight distributions of codes, give a new and efficient method to determine the minimum weight \(d\) of doubly even self-dual \([2n,n,d]\) codes constructed by using Hadamard matrices of order \(n = 8t + 4\) with \(t \geq 1\), and present a new proof that the \([2n,n,d]\) codes have \(d \geq 8\) for all types of Hadamard matrices of order \(n = 8t + 4\) with \(t \geq 1\). Finally, we discuss doubly even self-dual \([72,36,d]\) codes with \(d = 8\) or \(d = 12\) constructed by using all currently known Hadamard matrices of order \(n = 36\).