Related papers: Constructive Spherical Codes by Hopf Foliations
We present a topological characterization of time-periodically driven two-band models in 2+1 dimensions as Hopf insulators. The intrinsic periodicity of the Floquet system with respect to both time and the underlying two-dimensional…
We generalize a construction of non-binary quantum LDPC codes over $\F_{2^m}$ due to \cite{KHIS11a} and apply it in particular to toric codes. We obtain in this way not only codes with better rates than toric codes but also improve…
Heinz Hopf's famous fibrations of the 2n+1-sphere by great circles, the 4n+3-sphere by great 3-spheres, and the 15-sphere by great 7-spheres have a number of interesting properties. Besides providing the first examples of homotopically…
We consider the problem of constructing distributed overlay networks, where nodes in a reconfigurable system can create or sever connections with nodes whose identifiers they know. Initially, each node knows only its own and its neighbors'…
It is known that the $(2k-1)$-sphere has at most $2^{O(n^k \log n)}$ combinatorially distinct triangulations with $n$ vertices, for every $k\ge 2$. Here we construct at least $2^{\Omega(n^k)}$ such triangulations, improving on the previous…
We study the list decodability of different ensembles of codes over the real alphabet under the assumption of an omniscient adversary. It is a well-known result that when the source and the adversary have power constraints $ P $ and $ N $…
We describe a family of locally conformal Kaehler metrics on class 1 Hopf surfaces H containing some recent metrics constructed by P. Gauduchon and L. ornea. We study some canonical foliations associated to these metrics, in particular a…
The density of a code is the fraction of the coding space covered by packing balls centered around the codewords. This paper investigates the density of codes in the complex Stiefel and Grassmann manifolds equipped with the chordal…
Irreducible isoparametric foliations of arbitrary codimension q on complex projective spaces CP^n are classified, except if n=15 and q=1. Remarkably, there are noncongruent examples that pull back under the Hopf map to congruent foliations…
We develop a systematic framework for constructing spherical harmonics on the two-dimensional unit sphere as superpositions of Gaussian beams whose poles form well-separated point configurations. The distributional and analytic properties…
We propose a new class of error-correcting dynamic codes in two and three dimensions that has no explicit connection to any parent subsystem code. The two-dimensional code, which we call the CSS honeycomb code, is geometrically similar to…
Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight…
We introduce a spherical variant of Milnor's classifying construction for diffeological groups, based on quadratic normalization of barycentric coordinates. This construction gives rise to a contractible diffeological space endowed with…
A construction is presented that allows to produce subspace codes of long length using subspace codes of shorter length in combination with a rank metric code. The subspace distance of the resulting code, called linkage code, is as good as…
A covering code is a subset $\mathcal{C} \subseteq \{0,1\}^n$ with the property that any $z \in \{0,1\}^n$ is close to some $c \in \mathcal{C}$ in Hamming distance. For every $\epsilon,\delta>0$, we show a construction of a family of codes…
The paper discusses the construction of high dimensional spatial discretizations for arbitrary multivariate trigonometric polynomials, where the frequency support of the trigonometric polynomial is known. We suggest a construction based on…
In this paper, we construct several new quantum Floquet codes on compact, orientable, as well as non-orientable surfaces. In order to obtain such codes, we identify these surfaces with hyperbolic polygons and examine hyperbolic semi-regular…
This paper investigates several distinct attempts to generalize in higher dimension the standard 2-dimensional phyllotaxy set construction. We first recall known contructions for these sets on $2D$ manifolds of constant curvature (the…
We analyze a class of high performance, low decoding-data-flow error-correcting codes suitable for high bit-rate optical-fiber communication systems. A spatially-coupled split-component ensemble is defined, generalizing from the most…
We improve the previously best known upper bounds on the sizes of $\theta$-spherical codes for every $\theta<\theta^*\approx 62.997^{\circ}$ at least by a factor of $0.4325$, in sufficiently high dimensions. Furthermore, for sphere packing…