Related papers: Self-dual Hadamard bent sequences
Hadamard ideals were introduced in 2006 as a set of nonlinear polynomial equations whose zeros are uniquely related to Hadamard matrices with one or two circulant cores of a given order. Based on this idea, the cocyclic Hadamard test enable…
As an approximate nearest neighbor search technique, hashing has been widely applied in large-scale image retrieval due to its excellent efficiency. Most supervised deep hashing methods have similar loss designs with embedding learning,…
We introduce a class of regular unit Hadamard matrices whose entries consist of two complex numbers and their conjugates for a total of four complex numbers. We then show that these matrices are contained in the Bose-Mesner algebra of an…
Butson matrices are complex Hadamard matrices with entries in the complex roots of unity of given order. There is an interesting code in phase space related to this matrix (Armario et al. 2023). We study the covering radius of Butson…
Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received…
We establish Hadamard-type inequalities for a class of symmetric matrices called $k$-positive matrices for which the $m$-th elementary symmetric functions of their eigenvalues are positive for all $m\leq k$. These matrices arise naturally…
In this note, we study the existence of Hadamard matrices of order $36$ formed by codewords of weight $36$ in some ternary near-extremal self-dual codes of length $36$.
We provide a classification of generalized tilting modules and full exceptional sequences for the dual extension algebra of the path algebra of a uniformly oriented linear quiver modulo the ideal generated by paths of length two with its…
We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…
A common challenge faced in quantum physics is finding the extremal eigenvalues and eigenvectors of a Hamiltonian matrix in a vector space so large that linear algebra operations on general vectors are not possible. There are numerous…
We study a method of producing approximately diagonal 1-qubit gates. For each positive integer, the method provides a sequence of gates that are defined iteratively from a fixed diagonal gate and an arbitrary gate. These sequences are…
We study natural linear representations of self-similar groups over finite fields. In particular, we show that if the group is generated by a finite automaton, then obtained matrices are automatic. This shows a new relation between two…
The ranks and kernels of generalized Hadamard matrices are studied. It is proven that any generalized Hadamard matrix $H(q,\lambda)$ over $F_q$, $q>3$, or $q=3$ and $\gcd(3,\lambda)\not =1$, generates a self-orthogonal code. This result…
A complete classification of quaternary complex Hadamard matrices of orders 10, 12 and 14 is given, and a new parametrization scheme for obtaining new examples of affine parametric families of complex Hadamard matrices is provided. On the…
This paper presents a class of random orthogonal sequences associated with the number theoretic Hilbert transform. We present a constructive procedure for finding the random sequences for different modulus values. These random sequences…
The purpose of this paper is to introduce new parametric families of complex Hadamard matrices in two different ways. First, we prove that every real Hadamard matrix of order N>=4 admits an affine orbit. This settles a recent open problem…
We study the one-dimensional totally asymmetric simple exclusion process in contact with two reservoirs including also a fugacity at one boundary. The eigenvectors and the eigenvalues of the corresponding Markov matrix are computed using…
We construct many symmetric Hadamard matrices of small order by using the so called propus construction. The necessary difference families are constructed by restricting the search to the families which admit a nontrivial multiplier. Our…
The Hadamard maximal determinant (maxdet) problem is to find the maximum determinant D(n) of a square {+1, -1} matrix of given order n. Such a matrix with maximum determinant is called a saturated D-optimal design. We consider some cases…
Skeleton is a new notion designed for constructing space-filling curves of self-similar sets. It is shown in [Dai, Rao and Zhang, Space-filling curves of self-similar sets (II): Edge-to-trail substitution…