Boolean Functions and Permanents of Sylvester Hadamard Matrices
One of the fastest known general techniques for computing permanents is Ryser’s formula. On this note, we show that this formula over Sylvester Hadamard matrices of order <inline-formula><math display="inline"><semantics><msup><mn>2</mn><mi>m</m...
Main Author: | José Andrés Armario |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-01-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/2/177 |
Similar Items
-
Construction of Sylvester-Hadamard Matrices by Using Binary Code
Published: (2009-04-01) -
Boolean Functions with Affine Annihilators
by: A. S. Zelenetsky, et al.
Published: (2021-04-01) -
Theory and applications of higher-dimensional Hadamard matrices /
by: 518684 Yang, Yi Xian, et al.
Published: (c201) -
Hadamard Matrices : Constructions using Number Theory and Linear Algebra /
by: Seberry, Jennifer, 1944-, author 637003, et al.
Published: (2020) -
Nonlinearity of incomplete Boolean functions: prioritizing spectra calculation
by: Piotr Porwik
Published: (2022-12-01)