COMPLEX WEIGHING MATRICES AND QUATERNARY CODES

Abstract Weighing matrices with entries in the complex cubic and sextic roots of unity are employed to construct Hermitian self-dual codes and Hermitian linear complementary dual codes over the finite field $\mathrm {GF}(4).$ The parameters of these codes are explored for small matrix orders and weights.

Authors

Institutions

Publication Details

Journal
Bulletin of the Australian Mathematical Society
Published
2024-10-22
DOI
https://doi.org/10.1017/s0004972724000893
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

COMPLEX WEIGHING MATRICES AND QUATERNARY CODES

Patrick Solé, Minjia Shi, Ronan Egan, DANNI LU
Bulletin of the Australian Mathematical Society
Coding theory and cryptography
article

COMPLEX WEIGHING MATRICES AND QUATERNARY CODES

Patrick Solé, Minjia Shi, Ronan Egan, DANNI LU
article en

Abstract

Abstract Weighing matrices with entries in the complex cubic and sextic roots of unity are employed to construct Hermitian self-dual codes and Hermitian linear complementary dual codes over the finite field $\mathrm {GF}(4).$ The parameters of these codes are explored for small matrix orders and weights.

Bulletin of the Australian Mathematical SocietyVol. 112(1)
Centre National de la Recherche Scientifique (FR), Anhui University (CN), Aix-Marseille Université (FR), Centrale Méditerranée (FR), Institut Polytechnique de Bordeaux (FR), Dublin City University (IE)
Openalex Percentile: Top 87%
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.