Hadamard equivalence of binary matrices

Ki Hyeon Park, Hong Yeop Song

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)


In this paper, we propose a fast algorithm for checking the Hadamard equivalence of two binary matrices, and give an intuitive analysis on its time complexity. For this, we define Hadamard-equivalence on the set of binary matrices, and a function which induces a total order on them. With respect to this order relation, we define the minimal element which is used as a representative of an equivalence class. We applied the proposed algorithm to Hadamard matrices of smaller sizes, and show the results. Especially, the result for those of Payley type I and II of the same size 60 shows they are not equivalent. Finally, we discuss a new combinatorial problem of counting the number of and enumerating all the inequivalent binary minimal matrices of size mxn, and show the solutions for small values of m, n ≤ 4, leaving many of the observed properties as open problems.

Original languageEnglish
Title of host publication2009 15th Asia-Pacific Conference on Communications, APCC 2009
Number of pages5
Publication statusPublished - 2009
Event2009 15th Asia-Pacific Conference on Communications, APCC 2009 - Shanghai, China
Duration: 2009 Oct 82009 Oct 10

Publication series

Name2009 15th Asia-Pacific Conference on Communications, APCC 2009


Other2009 15th Asia-Pacific Conference on Communications, APCC 2009

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture
  • Electrical and Electronic Engineering
  • Communication


Dive into the research topics of 'Hadamard equivalence of binary matrices'. Together they form a unique fingerprint.

Cite this