Calculating symmetrical Hadamard matrices of Balonin-Seberry construction for coding and masking | Zendy

A. Sergeev | Zendy; Anton Vostrikov | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Calculating symmetrical Hadamard matrices of Balonin-Seberry construction for coding and masking

Author(s) -

A. Sergeev,

Anton Vostrikov

Publication year - 2020

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2020.09.197

Subject(s) - hadamard transform , hadamard matrix , computer science , coding (social sciences) , complex hadamard matrix , algorithm , hadamard product , block (permutation group theory) , matrix (chemical analysis) , masking (illustration) , theoretical computer science , telecommunications , mathematics , combinatorics , mathematical analysis , art , visual arts , statistics , materials science , composite material

We discuss the ways of calculating Hadamard matrices and estimating their possibilities when these matrices are found on orders 4t, symmetrical structures included. We demonstrate the shortcomings of Silvester, Paley and Scarpi classical methods regarding the orders of the matrices calculated. Based on Williamson array, Hadamard matrices of three-block construction are specified. We discuss two strategies of sequence search in order to form cyclic blocks of orthogonal matrices of Propus-like three-block construction, suggested by Balonin and Seberry. The results of our work can be a starting point for developing new approaches to search for symmetric Hadamard matrices used in noise-immune coding and filtering of radio signals, masking and compression of digital images, and other applied telecommunication problems.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research