Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

On Goethals and Seidel Array

View through CrossRef
Objectives: In this article, we aim to find a series of Hadamard matrices by suitable selection of the special class of matrices given in the Goethals and Seidel array and study the pattern obtained. Methods: In the presented work, the search technique of Hadamard matrices has been done by selecting special class of (0,1) negacyclic matrices instead of the back diagonal identity matrix given in Geothals and Seidel arrays and the possible existence of negacyclic matrices for the corresponding four matrices have been explored in each case. Findings: Corresponding to the special class of (0,1) negacyclic matrices, no sets of four negacyclic matrices have been obtained in the Goethal Seidel array, for even orders. For odd orders, except in the case when all four matrices are equal and the case when there is a pair of equal matrices, many outputs have been obtained for the remaining cases, the search domain being upto 11,9 and 7 for the case of two different, three different and four different matrices respectively, in the Goethal Seidel array. Novelty: The selection of special class of negacyclic matrices instead of the back diagonal identity matrix and finding the corresponding four negacyclic matrices in Goethals and Seidel arrays for constructing Hadamard matrices provides a new approach to the construction of Hadamard matrices. Keywords: Hadamard matrix, Circulant matrix, Williamson matrices, Orthogonal array, Goethals and Seidel array
Title: On Goethals and Seidel Array
Description:
Objectives: In this article, we aim to find a series of Hadamard matrices by suitable selection of the special class of matrices given in the Goethals and Seidel array and study the pattern obtained.
Methods: In the presented work, the search technique of Hadamard matrices has been done by selecting special class of (0,1) negacyclic matrices instead of the back diagonal identity matrix given in Geothals and Seidel arrays and the possible existence of negacyclic matrices for the corresponding four matrices have been explored in each case.
Findings: Corresponding to the special class of (0,1) negacyclic matrices, no sets of four negacyclic matrices have been obtained in the Goethal Seidel array, for even orders.
For odd orders, except in the case when all four matrices are equal and the case when there is a pair of equal matrices, many outputs have been obtained for the remaining cases, the search domain being upto 11,9 and 7 for the case of two different, three different and four different matrices respectively, in the Goethal Seidel array.
Novelty: The selection of special class of negacyclic matrices instead of the back diagonal identity matrix and finding the corresponding four negacyclic matrices in Goethals and Seidel arrays for constructing Hadamard matrices provides a new approach to the construction of Hadamard matrices.
Keywords: Hadamard matrix, Circulant matrix, Williamson matrices, Orthogonal array, Goethals and Seidel array.

Related Results

A note on the Seidel and Seidel Laplacian matrices
A note on the Seidel and Seidel Laplacian matrices
In this paper we investigate the spectrum of the Seidel and Seidel Laplacian matrix of a graph. We generalized the concept of Seidel Laplacian matrix which denoted by Seidel matrix...
Seidel Equienergetic Graphs
Seidel Equienergetic Graphs
The Seidel matrix S(G) of a graph G is the square matrix with diagonal entries zeroes and off diagonal entries are – 1 or 1 corresponding to the adjacency and non-adjacency. The Se...
Functional Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein-Pfender Bound
Functional Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein-Pfender Bound
Pfender \textit{[J. Combin. Theory Ser. A, 2007]} provided a one-line proof for a variant of the Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein upper bound for spherical codes, ...
Robust and Efficient Reduced Newton (Seidel) Methods Based on Residual Ordering
Robust and Efficient Reduced Newton (Seidel) Methods Based on Residual Ordering
Abstract The Sequential Fully Implicit formulation for reservoir simulation allows for specialized solution methods for the flow and transport subproblems. The trans...
Seidel Switching and Graph Energy
Seidel Switching and Graph Energy
The energy of a graph T is the sum of the absolute values of the eigenvalues of the adjacency matrix of T. Seidel switching is an operation on the edge set of T. In some special ca...
Non‐circular signals for nested array: sum–difference co‐array and direction of arrival estimation algorithm
Non‐circular signals for nested array: sum–difference co‐array and direction of arrival estimation algorithm
Nested array has aroused remarkable attention due to the capability to obtain both enhanced degrees of freedom (DOFs) and enlarged array aperture, whereas only difference co‐array ...
Designing large-scale antenna array using sub-array
Designing large-scale antenna array using sub-array
Antenna array of large scale have been examined for different applications including 5G technology. To get better data rate or a reliable link substantial number of antenna arrays ...

Back to Top