Circulant partial hadamard matrices: Construction via general difference sets and its application to fMRI experiments

Yuan Lung Lin, Frederick Kin Hing Phoa, Ming-Hung Kao

Research output: Contribution to journalArticle

Abstract

An m × n matrix A = (ai, j) is circulant if ai+1,j+1 = ai, j where the subscripts are reduced modulo n. A question arising in stream cypher cryptanalysis is reframed as follows: For given n, what is the maximum value of m for which there exists a circulant m × n (±1)-matrix A such that AAT = nIm. In 2013, Craigen et al. called such matrices circulant partial Hadamard matrices (CPHMs). They proved some important bounds and compiled a table of maximum values of m for small n via computer search. The matrices and algorithm are not in the literature. In this paper, we introduce general difference sets (GDSs), and derive a result that connects GDSs and CPHMs. We propose an algorithm, the difference variance algorithm (DVA), which helps us to search GDSs. In this work, the GDSs with respect to CPHMs listed by Craigen et al. when r = 0, 2 are found by DVA, and some new lower bounds are given for the first time.

Original languageEnglish (US)
Pages (from-to)1715-1724
Number of pages10
JournalStatistica Sinica
Volume27
Issue number4
DOIs
StatePublished - Oct 1 2017

Fingerprint

Partial Matrix
Difference Set
Hadamard Matrix
Functional Magnetic Resonance Imaging
Experiment
Nim
Subscript
Stream Cipher
Circulant Matrix
Cryptanalysis
Modulo
Table
Lower bound
Functional magnetic resonance imaging

Keywords

  • Circulant partial hadamard matrices
  • Functional magnetic resonance imaging (fMRI)
  • General difference sets

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty

Cite this

Circulant partial hadamard matrices : Construction via general difference sets and its application to fMRI experiments. / Lin, Yuan Lung; Phoa, Frederick Kin Hing; Kao, Ming-Hung.

In: Statistica Sinica, Vol. 27, No. 4, 01.10.2017, p. 1715-1724.

Research output: Contribution to journalArticle

@article{c4546941cebe451fb219ba541cfd8f08,
title = "Circulant partial hadamard matrices: Construction via general difference sets and its application to fMRI experiments",
abstract = "An m × n matrix A = (ai, j) is circulant if ai+1,j+1 = ai, j where the subscripts are reduced modulo n. A question arising in stream cypher cryptanalysis is reframed as follows: For given n, what is the maximum value of m for which there exists a circulant m × n (±1)-matrix A such that AAT = nIm. In 2013, Craigen et al. called such matrices circulant partial Hadamard matrices (CPHMs). They proved some important bounds and compiled a table of maximum values of m for small n via computer search. The matrices and algorithm are not in the literature. In this paper, we introduce general difference sets (GDSs), and derive a result that connects GDSs and CPHMs. We propose an algorithm, the difference variance algorithm (DVA), which helps us to search GDSs. In this work, the GDSs with respect to CPHMs listed by Craigen et al. when r = 0, 2 are found by DVA, and some new lower bounds are given for the first time.",
keywords = "Circulant partial hadamard matrices, Functional magnetic resonance imaging (fMRI), General difference sets",
author = "Lin, {Yuan Lung} and Phoa, {Frederick Kin Hing} and Ming-Hung Kao",
year = "2017",
month = "10",
day = "1",
doi = "10.5705/ss.202016.0254",
language = "English (US)",
volume = "27",
pages = "1715--1724",
journal = "Statistica Sinica",
issn = "1017-0405",
publisher = "Institute of Statistical Science",
number = "4",

}

TY - JOUR

T1 - Circulant partial hadamard matrices

T2 - Construction via general difference sets and its application to fMRI experiments

AU - Lin, Yuan Lung

AU - Phoa, Frederick Kin Hing

AU - Kao, Ming-Hung

PY - 2017/10/1

Y1 - 2017/10/1

N2 - An m × n matrix A = (ai, j) is circulant if ai+1,j+1 = ai, j where the subscripts are reduced modulo n. A question arising in stream cypher cryptanalysis is reframed as follows: For given n, what is the maximum value of m for which there exists a circulant m × n (±1)-matrix A such that AAT = nIm. In 2013, Craigen et al. called such matrices circulant partial Hadamard matrices (CPHMs). They proved some important bounds and compiled a table of maximum values of m for small n via computer search. The matrices and algorithm are not in the literature. In this paper, we introduce general difference sets (GDSs), and derive a result that connects GDSs and CPHMs. We propose an algorithm, the difference variance algorithm (DVA), which helps us to search GDSs. In this work, the GDSs with respect to CPHMs listed by Craigen et al. when r = 0, 2 are found by DVA, and some new lower bounds are given for the first time.

AB - An m × n matrix A = (ai, j) is circulant if ai+1,j+1 = ai, j where the subscripts are reduced modulo n. A question arising in stream cypher cryptanalysis is reframed as follows: For given n, what is the maximum value of m for which there exists a circulant m × n (±1)-matrix A such that AAT = nIm. In 2013, Craigen et al. called such matrices circulant partial Hadamard matrices (CPHMs). They proved some important bounds and compiled a table of maximum values of m for small n via computer search. The matrices and algorithm are not in the literature. In this paper, we introduce general difference sets (GDSs), and derive a result that connects GDSs and CPHMs. We propose an algorithm, the difference variance algorithm (DVA), which helps us to search GDSs. In this work, the GDSs with respect to CPHMs listed by Craigen et al. when r = 0, 2 are found by DVA, and some new lower bounds are given for the first time.

KW - Circulant partial hadamard matrices

KW - Functional magnetic resonance imaging (fMRI)

KW - General difference sets

UR - http://www.scopus.com/inward/record.url?scp=85029187614&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85029187614&partnerID=8YFLogxK

U2 - 10.5705/ss.202016.0254

DO - 10.5705/ss.202016.0254

M3 - Article

AN - SCOPUS:85029187614

VL - 27

SP - 1715

EP - 1724

JO - Statistica Sinica

JF - Statistica Sinica

SN - 1017-0405

IS - 4

ER -