Group invariant weighing matrices

  title={Group invariant weighing matrices},
  author={Ming Ming Tan},
  journal={Designs, Codes and Cryptography},
  • M. Tan
  • Published 2018
  • Mathematics, Computer Science
  • Designs, Codes and Cryptography
We investigate the existence problem of group invariant matrices using algebraic approaches. We extend the usual concept of multipliers to group rings with cyclotomic integers as coefficients. This concept is combined with the field descent method and rational idempotents to develop new non-existence results. 
A feasibility approach for constructing combinatorial designs of circulant type
This work proposes an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelation, and explicitly construct two newcirculant weighing matrices, whose existence was previously marked as unresolved in the most recent version of Strassler’s table. Expand
New nonexistence results on circulant weighing matrices
Six cases are resolved, showing that there are no weight 81 CW matrices for n=110, $130, $143, or $154, and also no $CW(116,49)$ or $ CW(143,36)$. Expand
Recent Applications
TorqSense transducers from Sensor Technology are playing a key role in the development of commercial-scale in-stream tidal turbines produced by Irish company, OpenHydro. They are being used to testExpand


Study of proper circulant weighing matrices with weight 9
The first theoretical proof of the spectrum of orders n for which circulant weighing matrices with weight 9 exist is provided, which consists of those positive integers n, which are multiples of 13 or 24. Expand
Hadamard Matrices from Weighing Matrices via Signed Groups
This paper gives classes of Hadamard matrices including at least 170 new orders 2tp,p ≤ 3999, and illustrates how this method increases the versatility of some recent constructions that use block sequences. Expand
On the Existance of Certain Circulant Weighing Matrices
We prove nonexistence of circulant weighing matrices with parameters from ten previously open entries of the updated Strassler’s table. The method of proof utilizes some modular constraints onExpand
Characters and Cyclotomic Fields in Finite Geometry
1. Introduction: The nature of the problems.- The combinatorial structures in question.- Group rings, characters, Fourier analysis.- Number theoretic tools.- Algebraic-combinatorial tools. 2. TheExpand
Classification of weighing matrices of order 13 and weight 9
  • H. Ohmori
  • Computer Science, Mathematics
  • Discret. Math.
  • 1993
A set of 71 weighing matrices is constructed, which contains all inequivalent matrices of order 13 and weight 9, by using the intersection pattern conditions with the aid of a computer. Expand
There is no circulant weighing matrix of order 60 and weight 36
With the help of a computer, we prove the assertion made in the title. Dragomir Ž. D̄oković, Ilias S. Kotsireas
Circulant weighing matrices whose order and weight are products of powers of 2 and 3
All circulant weighing matrices whose order and weight are products of powers of 2 and 3 are classified and it is shown that proper CW(v,36)@?s exist for all v=0(mod48), all of which are new. Expand
Cyclotomic integers and finite geometry
The most powerful method for the study of finite geometries with regular or quasiregular automorphism groups G is to translate their definition into an equation over the integral group ring 2[G] andExpand
Circulant weighing matrices
The results fill in 52 missing entries in Strassler’s table of circulant weighing matrices (Strassler 1997), which considers matrices of order 1–200 with weight k ≤ 100. Expand
The Field Descent Method
Applications include the verification of Lander’s conjecture for all difference sets whose order is a power of a prime >3 and for all McFarland, Spence and Chen/Davis/Jedwab difference sets. Expand