Related papers: Constructive Spherical Codes by Hopf Foliations
Fractional Repetition (FR) codes are well known class of Distributed Replication-based Simple Storage (Dress) codes for the Distributed Storage Systems (DSSs). In such systems, the replicas of data packets encoded by Maximum Distance…
Most of the calculations in standard sphere decoders are redundant, in the sense that they either calculate quantities that are never used or calculate some quantities more than once. A new method, which is applicable to lattices as well as…
In 2002 Meersseman-Verjovsky [2] constructed a smooth, codimension-one, foliation on 5-sphere by complex surfaces with two compact leaves. The aim of this note is to improve their construction in order to give a smooth foliation on 5-sphere…
We formulate the Hopf algebra underlying the su(2|2) worldsheet S-matrix of the AdS_5 x S^5 string in the AdS/CFT correspondence. For this we extend the previous construction in the su(1|2) subsector due to Janik to the full algebra by…
In this paper we construct new optimal hierarchical locally recoverable codes. Our construction is based on a combination of the ideas of \cite{ballentine2019codes,sasidharan2015codes} with an algebraic number theoretical approach that…
Spherical t-designs are Chebyshev-type averaging sets on the d-sphere S^d which are exact for polynomials of degree at most t. This concept was introduced in 1977 by Delsarte, Goethals, and Seidel, who also found the minimum possible size…
In this article we study the higher topological complexity ${\sf TC}_r(X)$ in the case when $X$ is an aspherical space, $X=K(\pi, 1)$ and $r\ge 2$. We give a characterisation of ${\sf TC}_r(K(\pi, 1))$ in terms of classifying spaces for…
We consider the design of regenerating codes for distributed storage systems that enjoy the property of local, exact and uncoded repair, i.e., (a) upon failure, a node can be regenerated by simply downloading packets from the surviving…
We construct biharmonic real hypersurfaces and Lagrangian submanifolds of Clifford torus type in $CP^n$ via the Hopf fibration; and get new examples of biharmonic submanifolds in $S^{2n+1}$ as byproducts .
We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N\sim n^\alpha, 0<\alpha\le 2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical…
We define the concept of symplectic foliation on a symplectic manifold and provide a method of constructing many examples, by using asymptotically holomorphic techniques.
Color codes are a class of topological quantum codes with a high error threshold and large set of transversal encoded gates, and are thus suitable for fault tolerant quantum computation in two-dimensional architectures. Recently,…
Sphere decoding (SD) of polar codes is an efficient method to achieve the error performance of maximum likelihood (ML) decoding. But the complexity of the conventional sphere decoder is still high, where the candidates in a target sphere…
A hybrid helical structure of equal-sized hard spheres in cylindrical confinement was discovered as a 'by-product' of the recently developed sequential deposition approach [Physical Review E 84, 050302(R) (2011)] for constructing the…
In a previous study, we presented a construction of spherical 3-designs. In the current study, using this construction, we present new optimal antipodal spherical codes in the space of spherical harmonics. Our construction is a…
Two classes of turbo codes over high-order finite fields are introduced. The codes are derived from a particular protograph sub-ensemble of the (dv=2,dc=3) low-density parity-check code ensemble. A first construction is derived as a…
Creating spherical initial conditions in smoothed particle hydrodynamics simulations that are spherically conformal is a difficult task. Here, we describe two algorithmic methods for evenly distributing points on surfaces, that when paired…
We present a detailed algorithm to construct symbolic encodings for chaotic attractors of three-dimensional flows. It is based on a topological analysis of unstable periodic orbits embedded in the attractor and follows the approach proposed…
In this paper, we present a construction of linear codes over $\f_{2^t}$ from Boolean functions, which is a generalization of Ding's method \cite[Theorem 9]{Ding15}. Based on this construction, we give two classes of linear codes…
In the distributed setting, the only existing constructions of \textit{sparse skeletons}, (i.e., subgraphs with $O(n)$ edges) either use randomization or large messages, or require $\Omega(D)$ time, where $D$ is the hop-diameter of the…