An algorithm for constructing and classifying the space of small integer weighing matrices
Abstract
In this paper we describe an algorithm for generating all the possible PIW(m,n,k) - integer m× n Weighing matrices of weight k up to Hadamard equivalence. Our method is efficient on a personal computer for small size matrices, up to m n=12, and k 50. As a by product we also improved the nsoks riel2006nsoks algorithm to find all possible representations of an integer k as a sum of n integer squares. We have implemented our algorithm in Sagemath and as an example we provide a complete classification for \ n=m=7 and k=25. Our list of IW(7,25) can serve as a step towards finding the open classical weighing matrix W(35,25).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.