Proper circulant weighing matrices CW(q^3-1, q^2) for every odd prime power q

For every odd prime power q we give an explicit proper circulant weighing matrix of order q^3-1 and weight q^2. Its first row is the sum of η(-N(u)) [(1-u)/(2u)] over the elements u of trace 1 in F_{q^3}, where N is the norm to F_q and η the quadratic character of F_q. Together with the known construction for even q, this shows that a proper CW(q^3-1, q^2) exists for every prime power q, as Arasu, Gordon and Zhang suggested. The case q=7 gives a proper CW(342,49), a parameter pair recorded as nonexistent in the La Jolla Circulant Weighing Matrix Repository, and q=9 gives a proper CW(728,81), recorded there as open. The proof uses the geometry of conics in PG(2,q) and Gauss and Jacobi sums.The archive contains the first rows for all odd q ≤ 27 and the programs that build and check them.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-11
DOI
https://doi.org/10.5281/zenodo.24138591
Primary Topic
Coding theory and cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Proper circulant weighing matrices CW(q^3-1, q^2) for every odd prime power q

Theo Nicolas Sitjar
Zenodo (CERN European Organization for Nuclear Research)
Coding theory and cryptography
preprint

Proper circulant weighing matrices CW(q^3-1, q^2) for every odd prime power q

Theo Nicolas Sitjar
preprint en

Abstract

For every odd prime power q we give an explicit proper circulant weighing matrix of order q^3-1 and weight q^2. Its first row is the sum of η(-N(u)) [(1-u)/(2u)] over the elements u of trace 1 in F_{q^3}, where N is the norm to F_q and η the quadratic character of F_q. Together with the known construction for even q, this shows that a proper CW(q^3-1, q^2) exists for every prime power q, as Arasu, Gordon and Zhang suggested. The case q=7 gives a proper CW(342,49), a parameter pair recorded as nonexistent in the La Jolla Circulant Weighing Matrix Repository, and q=9 gives a proper CW(728,81), recorded there as open. The proof uses the geometry of conics in PG(2,q) and Gauss and Jacobi sums.The archive contains the first rows for all odd q ≤ 27 and the programs that build and check them.

Zenodo (CERN European Organization for Nuclear Research)
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon