相关论文: Construction of symmetric Hadamard matrices

If $N=2^k > 8$ then there exist exactly $[(k-1)/2]$ pairwise nonequivalent $Z_4$-linear Hadamard $(N,2N,N/2)$-codes and $[(k+1)/2]$ pairwise nonequivalent $Z_4$-linear extended perfect $(N,2^N/2N,4)$-codes. A recurrent construction of…

We introduce qustochastic matrices as the bistochastic matrices arising from quaternionic unitary matrices by replacing each entry with the square of its norm. This is the quaternionic analogue of the unistochastic matrices studied by…

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 prove that if $A$ and $B$ are Hadamard matrices which are both of size $4 \times 4$ or $5 \times 5$ and in dephased form, then $tr(A) = tr(B)$ implies that $A$ and $B$ have the same eigenvalues, including multiplicity. We calculate…

We consider random symmetric matrices with independent entries distributed according to the Haar measure on $\mathbb{Z}_p$ for odd primes $p$ and derive the distribution of their canonical form with respect to several equivalence relations.…

We study orthogonal matrices whose elements have moduli $\leq 1$. This paper shows that the existence of two such families of matrices is equivalent. Specifically we show that the existence of an Hadamard matrix of order $4t$ is equivalent…

Complex Hadamard matrices, consisting of unimodular entries with arbitrary phases, play an important role in the theory of quantum information. We review basic properties of complex Hadamard matrices and present a catalogue of inequivalent…

Let $D(n)$ be the number of pairwise disjoint Steiner quadruple systems. A simple counting argument shows that $D(n) \leq n-3$ and a set of $n-3$ such systems is called a large set. No nontrivial large set was constructed yet, although it…

In this paper, we construct odd unimodular lattices in dimensions n=36,37 having minimum norm 3 and 4s=n-16, where s is the minimum norm of the shadow. We also construct odd unimodular lattices in dimensions n=41,43,44 having minimum norm 4…

Building on the classification of all characteristic polynomials of integer symmetric matrices having small span (span less than 4), we obtain a classification of small-span polynomials that are the characteristic polynomial of a Hermitian…

The general method of the supersymmetrization of the soliton equations with the odd (bi) hamiltonian structure is established. New version of the supersymmetric N=2,4 (Modified) Korteweg de Vries equation is given, as an example. The second…

We study the isolated partial Hadamard matrices, under the assumption that the entries are roots of unity, or more generally, under the assumption that the combinatorics comes from vanishing sums of roots of unity. We first review the…

Permutation decoding is a technique which involves finding a subset $S$, called PD-set, of the permutation automorphism group of a code $C$ in order to assist in decoding. An explicit construction of $\left \lfloor{\frac{2^m-m-1}{1+m}}…

We investigate point arrangements $v_i\in\mathbb R^d,i\in \{1,...,n \}$ with certain prescribed symmetries. The arrangement space of $v$ is the column span of the matrix in which the $v_i$ are the rows. We characterize properties of $v$ in…

We give a constructive characterization of matrices satisfying the reverse-order law for the Moore--Penrose pseudoinverse. In particular, for a given matrix $A$ we construct another matrix $B$, of arbitrary compatible size and chosen rank,…

We construct six new explicit families of linear maximum sum-rank distance (MSRD) codes, each of which has the smallest field sizes among all known MSRD codes for some parameter regime. Using them and a previous result of the author, we…

We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…

We survey partial geometric designs and investigate their concurrences of points. The concurrence matrix of a design, which encodes the concurrences of pairs of points, can be used in the classification of designs in some extent. An…

Distribution matching and dematching (DM/invDM) are key functions in probabilistic shaping (PS). Recently techniques for low complexity implementation of DM/invDM have been well studied. Our previously proposed hierarchical DM (HiDM) is one…

To any complex Hadamard matrix H one associates a spin model commuting square, and therefore a hyperfinite subfactor. The standard invariant of this subfactor captures certain "group-like" symmetries of H. To gain some insight, we compute…