相关论文: How to Construct Mutually Orthogonal Complementary…
There are fairly large families of unitarily inequivalent complete sets of N+1 mutually unbiased bases (MUBs) in C^N for various prime powers N. The number of such sets is not bounded above by any polynomial as a function of N. While it is…
A linear code with parameters of the form $[n, k, n-k+1]$ is referred to as an MDS (maximum distance separable) code. A linear code with parameters of the form $[n, k, n-k]$ is said to be almost MDS (i.e., almost maximum distance separable)…
Intermediate dimensions are a class of new fractal dimensions which provide a spectrum of dimensions interpolating between the Hausdorff and box-counting dimensions. In this paper, we study the intermediate dimensions of Moran sets. Moran…
Multiconfiguration expansions frequently target valence correlation and correlation between valence electrons and the outermost core electrons. Correlation within the core is often neglected. A large orbital basis is needed to saturate both…
Mutually unbiased bases which is also maximally entangled bases is called mutually unbiased maximally entangled bases (MUMEBs). We study the construction of MUMEBs in bipartite system. In detail, we construct 2(p^a-1) MUMEBs in C^d\otimes…
Zero correlation zone (ZCZ) sequences and Golay sequences are two kinds of sequences with different preferable correlation properties. It was shown by Gong \textit{et al.} and Chen \textit{et al.} that some Golay sequences also possess a…
Following the basic idea proposed by the present authors in recent paper, a possible form of the orthogonal set for many-body system consisting of six kinds of boson operators is developed. In contrast to the recent paper, in which the…
Function-Correcting Codes (FCCs) enable reliable computation of a function of a $k$-bit message over noisy channels without requiring full message recovery. In this work, we study optimal single-error correcting FCCs (SEFCCs) for…
Boolean networks have been the object of much attention, especially since S. Kauffman proposed them in the 1960's as models for gene regulatory networks. These systems are characterized by being defined on a Boolean state space and by…
In the present work, a highly efficient Moving Morphable Component (MMC) based approach for multi-resolution topology optimization is proposed. In this approach, high-resolution optimization results can be obtained with much less number of…
The non-overlapping sets of pictures are sets such that no two pictures in the set (properly) overlap. They are the generalization to two dimensions of the cross-bifix-free sets of strings. Non-overlapping sets of pictures are…
One matrix structure in the area of monotone Boolean functions is defined here. Some of its combinatorial, algebraic and algorithmic properties are derived. On the base of these properties, three algorithms are built. First of them…
In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…
In this paper, we employ the so-called semi-bent functions to achieve significant improvements over currently known methods regarding the number of orthogonal sequences per cell that can be assigned to a regular tessellation of hexagonal…
The finite size dependent enhancement of pairing in mesoscopic Fermi systems is studied under the assumption that the BCS approach is valid and that the two body force is size independent. Different systems are investigated such as…
This is the second of two papers investigating for which positive integers $m$ there exists a maximal antichain of size $m$ in the Boolean lattice $B_n$ (the power set of $[n]:=\{1,2,\dots,n\}$, ordered by inclusion). In the first part, the…
Golay complementary pair (GCP), first introduced by Golay in 1951, has been extensively studied and widely applied in communication systems. A $q$-ary GCP $\{\mathbf{A},\mathbf{B}\}$ consists of two $q$-ary complex sequences…
We find the exact size of a maximal non-commuting set in unipotent uppertriangular linear group $UU_4(\mathbb{F}_q)$ in terms of a non-commuting geometric structure (Refer Definition [10]), where $\mathbb{F}_q$ is the finite field with $q$…
We present a class of mappings between models with topological mass mechanism and purely topological models in arbitrary dimensions. These mappings are established by directly mapping the fields of one model in terms of the fields of the…
A fundamental challenge in approximating an unknown density using finite Gaussian mixture models is selecting the number of mixture components, also known as order. Traditional approaches choose a single best model using information…