Related papers: Optimal antipodal spherical codes in the space of …
In this short note we propose a new method for construction new nice arrangement on the sphere $S^d$ using the spaces of spherical harmonic.
We give a construction for spherical 3-designs. This construction is a generalization of Bondarenko's work.
This short paper is concerned with the use of spherical t-designs as optimal designs for the spherical harmonic regression model in three dimensions over a range of specified criteria. The nature of the designs is explored and their…
We prove the universal optimality of four remarkable spherical 11-designs in 48 dimensions either among all antipodal codes, or all spherical 3-designs, whose inner-products avoid the set $T_1=(-1/3,-1/6) \cup (1/6,1/3)$. We also prove the…
We determine the smallest size of a non-antipodal spherical design with harmonic indices $\{1,3,\dots,2m-1\}$ to be $2m+1$, where $m$ is a positive integer. This is achieved by proving an analogous result for interval designs.
We show that any spherically symmetric spacetime locally admits a maximal spacelike slicing and we give a procedure allowing its construction. The construction procedure that we have designed is based on purely geometrical arguments and, in…
Vector sets with optimal coherence according to the Welch bound cannot exist for all pairs of dimension and cardinality. If such an optimal vector set exists, it is an equiangular tight frame and represents the solution to a Grassmannian…
In this paper, we compare two optimization algorithms using full Hessian and approximation Hessian to obtain numerical spherical designs through their variational characterization. Based on the obtained spherical design point sets, we…
We consider the coding problem in the Stiefel manifold with chordal distance. After considering various low-dimensional instances of this problem, we use Rankin's bounds on spherical codes to prove upper bounds on the minimum distance of a…
Recently a construction of optimal non-constant dimension subspace codes, also termed projective space codes, has been reported in a paper of Honold-Kiermaier-Kurz. Restricted to binary codes in a 5-dimensional ambient space with minimum…
Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…
In this paper we propose constellations with suitable structure which allow one to construct codes with excellent diversity using geometrical symmetry and numerical methods. We also demonstrate how these structured constellations…
We determine the polar and the maximal antipodal set $P$ for the outer 3-symmetric space $\mathbb{S}^7 \times \mathbb{S}^7 = \mathrm{Spin}_8/G_2$ where the 3-symmetric structure is given by the triality automorphism $\tau$ on…
We show that among antipodal $2d$-point configurations on the sphere $S^{d-1}$ in $\mathbb R^d$, the set of vertices of a regular cross-polytope inscribed in $S^{d-1}$ uniquely solves the best-covering problem (this is new for $d\geq 5$)…
We take an additional step towards the optimization of the novel finite-range pseudopotential at constrained Hartree-Fock-Bogolyubov level and implement an optimization procedure within an axial code using harmonic oscillator basis. We…
A construction for sphere packings is introduced that is parallel to the ``anticode'' construction for codes. This provides a simple way to view Vardy's recent 20-dimensional sphere packing, and also produces packings in dimensions 22,…
This paper is dedicated to the construction of multidimensional spherical monogenics. Firstly, we investigate the construction of monogenic functions in dimension $3$ by applying the Dirac operator to the orthonormal bases of spherical…
A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and…
A new design method for high rate, fully diverse ('spherical') space frequency codes for MIMO-OFDM systems is proposed, which works for arbitrary numbers of antennas and subcarriers. The construction exploits a differential geometric…
We show that the spectral embeddings of all known triangle-free strongly regular graphs are optimal spherical codes (the new cases are $56$ points in $20$ dimensions, $50$ points in $21$ dimensions, and $77$ points in $21$ dimensions), as…