English
Related papers

Related papers: Constructive Spherical Codes by Hopf Foliations

200 papers

We construct locally recoverable codes with hierarchy from surfaces in $\mathbb{A}^3$ admitting a fibration by curves of Artin-Schreier or Kummer type. We derive the parameters of our codes by leveraging the geometry and arithmetic of the…

Algebraic Geometry · Mathematics 2026-02-03 Carolina Araujo , Luana Costa , Beth Malmskog , Jorge Mello , Eliza Menezes , Cecília Salgado , Lara Vicino

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…

Information Theory · Computer Science 2007-07-13 Oliver Henkel

We give a new construction of algebraic codes which are efficiently list decodable from a fraction $1-R-\eps$ of adversarial errors where $R$ is the rate of the code, for any desired positive constant $\eps$. The worst-case list size output…

Information Theory · Computer Science 2015-03-20 Venkatesan Guruswami , Chaoping Xing

We obtain algorithmically effective versions of the dense lattice sphere packings constructed from orders in $\mathbb{Q}$-division rings by the first author. The lattices in question are lifts of suitable codes from prime characteristic to…

Number Theory · Mathematics 2022-04-12 Nihar Gargava , Vlad Serban

We analyse several constructions of random point sets on the sphere $\mathbb{S}^{3}\subset\mathbb{R}^4$ evaluating and comparing them through their discrete logarithmic energy: \begin{equation*} E_0(\omega_N) = \sum_{\substack{i, j=1\\ i…

Probability · Mathematics 2026-02-13 Ujué Etayo , Pablo G. Arce

We define a general procedure extending surgery to manifolds with foliation or Haefliger structure. We find a single obstruction to foliation surgery along an attaching sphere. When unobstructed, the surgery can be chosen to preserve…

Geometric Topology · Mathematics 2026-01-08 Benjamin B. McMillan

Fast-decodable distributed space-time codes are constructed by adapting the iterative code construction introduced in [1] to the N -relay multiple-input multiple-output channel, leading to the first fast-decodable distributed space-time…

Information Theory · Computer Science 2015-04-21 Amaro Barreal , Camilla Hollanti , Nadya Markin

With the help of a new type of functionals we study manifolds diffeomorphic to $S^2\times S^2$ and establish, in particular, the Hopf conjecture.

General Mathematics · Mathematics 2009-10-16 Valery Marenich

Subspace codes, and in particular cyclic subspace codes, have gained significant attention in recent years due to their applications in error correction for random network coding. In this paper, we introduce a new technique for constructing…

Information Theory · Computer Science 2025-07-15 Chiara Castello , Paolo Santonastaso

We introduce the $2$-nodal spherical deformation of certain singular fibers of genus $2$ fibrations, and use such deformations to construct various examples of simply connected minimal symplectic $4$-manifolds with small topology. More…

Geometric Topology · Mathematics 2021-02-17 Anar Akhmedov , Sümeyra Sakalli

Let $p$ be an odd prime and $r,s,m$ be positive integers. In this study, we initiate our exploration by delving into the intricate structure of all repeated-root cyclic codes and their duals with a length of $2^rp^s$ over the finite field…

Information Theory · Computer Science 2024-06-21 Lanqiang Li , Ziwen Cao , Tingting Wu , Li Liu

Here we study geodesics connecting two given points on odd-dimensional spheres respecting the Hopf fibration. This geodesic boundary value problem is completely solved in the case of 3-dimensional sphere and some partial results are…

Differential Geometry · Mathematics 2015-05-20 Der-Chen Chang , Irina Markina , Alexander Vasil'ev

We explain in some detail the geometric structure of spheres in any dimension. Our approach may be helpful for other homogeneous spaces (with other signatures) such as the de Sitter and anti-de Sitter spaces. We apply the procedure to the…

General Physics · Physics 2013-11-13 G. Avila , S. J. Castillo , J. A. Nieto

In earlier joint work with A. Connes on transverse index theory on foliations, cyclic cohomology adapted to Hopf algebras has emerged as a decisive tool in deciphering the total index class of the hypoelliptic signature operator. We have…

Differential Geometry · Mathematics 2015-02-10 Henri Moscovici

A new class of folded subspace codes for noncoherent network coding is presented. The codes can correct insertions and deletions beyond the unique decoding radius for any code rate $R\in[0,1]$. An efficient interpolation-based decoding…

Information Theory · Computer Science 2015-04-22 Hannes Bartz , Vladimir Sidorenko

In dynamical systems limit cycles arise as a result of a Hopf bifurcation, after a control parameter has crossed its critical value. In this study we present a constructive method to produce dissipative dynamics which lead to stable…

Chaotic Dynamics · Physics 2018-03-07 Astero Provata

Fractional repetition (FR) codes are a class of regenerating codes for distributed storage systems with an exact (table-based) repair process that is also uncoded, i.e., upon failure, a node is regenerated by simply downloading packets from…

Information Theory · Computer Science 2016-02-09 Oktay Olmez , Aditya Ramamoorthy

Hopfions, three-dimensional topological solitons characterized by nontrivial Hopf indices, represent a fundamental class of field configurations that emerge across diverse areas of physics. Despite extensive studies of isolated hopfions, a…

Strongly Correlated Electrons · Physics 2025-12-02 Wen-Tao Hou , Zhuoxian Xiang , Yizhou Liu , Jiadong Zang

We derive necessary and sufficient conditions for an ambiskew polynomial ring to have a Hopf algebra structure of a certain type. This construction generalizes many known Hopf algebras, for example U(sl2), U_q(sl2) and the enveloping…

Rings and Algebras · Mathematics 2008-03-26 Jonas T. Hartwig

Professor Cunsheng Ding gave cyclotomic constructions of cyclic codes with length being the product of two primes. In this paper, we study the cyclic codes of length $n=2^e$ and dimension $k=2^{e-1}$. Clearly, Ding's construction is not…

Information Theory · Computer Science 2018-08-21 Binbin Pang , Shixin Zhu , Ping Li