TWO-CIRCULANT CONFERENCE MATRICES



© Nickolay Balonin and Jennifer Seberry, 1.05.2014

Conference matrix catalogue and on-line algorithms


TABLE OF SEQUENCES


The conference matrix C is nxn matrix С'С=(n–1)I with zero diagonal and other ±1 units. The necessary condition of its existence: n–1 is sum of two squares. The problem orders are 22, 34, [46], 58, [66], 70, 78, [86], 94, n<100. Look also: two border two circulant

ЧИСЛЕННЫЕ МЕТОДЫ




MENU OF CATALOGUES

NUMERICAL ALGORITHMS

    

GALOIS FIELD ALGORITHMS

PALEY MATRICES

    

WEIGHING MATRICES






Matrices C6 and C10



Matrices C14 and C18



Matrices C26 and C30



Matrices C38 and C42



Mathon matrix С46



Matrices C50 and C54



Matrices C62 and C74



Matrix C82 and C90



Matrix C98 and C102




TWO BORDERS TWO CIRCULANT MATRICES


Rambler's Top100