Related papers: Constructive Spherical Codes by Hopf Foliations
Hopfions, as three-dimensional topologically nontrivial structures described by poloidal and toroidal winding numbers, hold promise as robust information carriers in spintronics, functional materials, and optical communications. Although…
We introduce a new class of autoregressive models for spherical time series, where the dimension of the spheres on which the observations of the time series are situated may be finite-dimensional or infinite-dimensional as in the case of a…
A circulant-based spatially-coupled (SC) code is constructed by partitioning the circulants of an underlying block code into a number of components, and then coupling copies of these components together. By connecting (coupling) several SC…
The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Yet, the codes being deployed in practice are fairly short. In this work, we address what we…
We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps.…
We argue supersymmetric generalizations of fuzzy two- and four-spheres based on the unitary-orthosymplectic algebras, $uosp(N|2)$ and $uosp(N|4)$, respectively. Supersymmetric version of Schwinger construction is applied to derive graded…
In this work, we construct some irreducible components of the space of two-dimensional holomorphic foliations on $\mathbb{P}^n$ associated to some algebraic representations of the affine Lie algebra $\mathfrak{aff}(\mathbb{C})$. We give a…
Nowadays there are several classes of constrained codes intended for different applications. The following two large classes can be distinguished. The first class contains codes with local constraints; for example, the source data must be…
Superconducting cosmic strings (SCSs) have received revived interests recently. In this paper we treat closed SCSs as oriented knotted line defects, and concentrate on their topology by studying the Hopf topological invariant. This…
We present a structural resolution to the exact evaluation of the partition function $p_k(n)$, systematically overcoming the limitations of traditional recursive and asymptotic methods. By framing the partition polytope $\mathcal{P}_{n,k}$…
In this manuscript, we consider decoding Grassmann codes, linear codes associated to Grassmannian of planes in an affine space. We look at the orbit structure of Grassmannian arising from the natural action of multiplicative group of…
We present a computational framework for galactic evolution based on a coupled stochastic nonlinear oscillator, implemented with the \textbf{Stochastic Hopf Engine}. Gas density ($G$) and star formation rate ($S$) co-evolve through a…
We construct multilevel lattice codes from multiquadratic number fields for the compound block-fading wiretap channel. More precisely, we specialize Construction $\pi_A$ over the ring of integers $\mathcal{O}_K$ and exploit rational primes…
The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…
Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…
Fault tolerance is a prerequisite for scalable quantum computing. Architectures based on 2D topological codes are effective for near-term implementations of fault tolerance. To obtain high performance with these architectures, we require a…
Nine new 2-D OOCs are presented here, all sharing the common feature of a code size that is much larger in relation to the number of time slots than those of constructions appearing previously in the literature. Each of these constructions…
A binary extended 1-perfect code $\mathcal C$ folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for $\mathcal C$, distinguishes among the 361…
In this work, we investigate novel algorithmic growth processes. In particular, we propose three growth operations, full doubling, RC doubling and doubling, and explore the algorithmic and structural properties of their resulting processes…
This paper presents an explicit construction for an $((n,k,d=n-1), (\alpha,\beta))$ regenerating code over a field $\mathbb{F}_Q$ operating at the Minimum Storage Regeneration (MSR) point. The MSR code can be constructed to have rate $k/n$…