vix.ing · top · new · best · stats · spec

Cyclic Difference Sets And Cyclic Hadamard Matrices

2011/09/29 by N. A. Carella, Carella, N. A.
Computer Science · Engineering · Mathematics · #05B10 #05B20 #11B83 #94A55 #Coding theory and cryptography #FOS: Mathematics #Number Theory (math.NT) #Wireless Communication Networks Research #graph theory and CDMA systems #math.NT #msc:05B10 #msc:05B20 #msc:11B83 #msc:94A55

paper · pdf · doi:10.48550/arxiv.1110.1322

Simpler And Improved Version, 8 Pages

openalex publication_date 2011/09/29 · arxiv created 2011/12/20 · arxiv updated 2011/12/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The collection of cyclic Hadamard matrices H = (ai - j) : 0 <= i, j < n, and ai = -1, 1 of order n is characterized by the orthogonality relation HHT = nI. Only two of such matrices are currently known. It will be shown that this collection consists of precisely two matrices. An application of this result implies that there are exactly seven Barker sequences over the binary set -1, 1.

Related