Higher dimensional Hadamard matrices

Abstract

The paper defines higher dimensional Hadamard matrices and enumerates on some of the simplest three-, four-, and five-dimensional cases and procedures for generating them. Special emphasis is given to proper matrices that have a dimensional hierarchy of orthogonalities. It is determined that this property lends itself primarily to the application of higher dimensional Hadamard matrices to error-correcting codes. A list of derived statements for n-dimensional Hadamard matrices are given, as well as a definition of Hadamard matrix families, such as minimal, Petrie polygon, antipodal (n-2)-dimensional sections, and double proximity shells.