On Constructions of Regular Hadamard Matrices and Bent Functions

Using the generalized Kronecker construction from two binary Hadamard matrices, we build new families of Hadamard matrices of square order, which keep many properties of the original matrices. Specifically, when one of the initial matrices is the Sylvester Hadamard matrix, the resulting Hadamard matrix is regular and has a bent function in each row or in each column. These bent functions belong to the Maiorana–McFarland class. When both initial Hadamard matrices are Sylvester Hadamard, regular Hadamard matrices having a bent function in each row and column are obtained. In this case, we can construct bent functions with maximal algebraic degree. Moreover, we are able to compute the dimension of the kernel and an upper bound for the rank. Finally, we give two specific constructions using Latin squares.

Authors

Institutions

Publication Details

Journal
Problems of Information Transmission
Published
2024-12-01
DOI
https://doi.org/10.1134/s003294602404001x
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Constructions of Regular Hadamard Matrices and Bent Functions

Victor Zinoviev, D. V. Zinoviev, Mercè Villanueva, Josep Rifà
Problems of Information Transmission
graph theory and CDMA systems
article

On Constructions of Regular Hadamard Matrices and Bent Functions

Victor Zinoviev, D. V. Zinoviev, Mercè Villanueva, Josep Rifà
article en

Abstract

Using the generalized Kronecker construction from two binary Hadamard matrices, we build new families of Hadamard matrices of square order, which keep many properties of the original matrices. Specifically, when one of the initial matrices is the Sylvester Hadamard matrix, the resulting Hadamard matrix is regular and has a bent function in each row or in each column. These bent functions belong to the Maiorana–McFarland class. When both initial Hadamard matrices are Sylvester Hadamard, regular Hadamard matrices having a bent function in each row and column are obtained. In this case, we can construct bent functions with maximal algebraic degree. Moreover, we are able to compute the dimension of the kernel and an upper bound for the rank. Finally, we give two specific constructions using Latin squares.

Problems of Information TransmissionVol. 60(4)
Universitat Autònoma de Barcelona (ES), Institute for Information Transmission Problems (RU)
Sustainable cities and communities
Openalex Percentile: Top 76%
graph theory and CDMA systems
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.

On Constructions of Regular Hadamard Matrices and Bent Functions — Victor Zinoviev, D. V. Zinoviev, et al. · Problems of Information Transmission (2024) | TGRS Research Map | TGRS