Construction of Hyperbolic Signal Sets from the Uniformization of Hyperelliptic Curves
Erika Patricia Dantas de Oliveira Guazzi, Reginaldo Palazzo Junior

TL;DR
This paper introduces a novel method for designing hyperbolic signal sets using the uniformization of hyperelliptic curves, linking complex geometry with digital communication system performance.
Contribution
It presents a systematic approach to construct hyperbolic signal sets via Fuchsian differential equations and establishes connections between hyperelliptic curve parameters and tessellation properties.
Findings
Fuchsian group generators derived from FDE solutions.
Largest fundamental polygon area correlates with minimal symbol error probability.
Relation established between tessellation parameters and hyperelliptic curve degree.
Abstract
In this paper, we present a new approach to the problem of designing hyperbolic signal sets matched to groups by use of Whittaker's proposal in the uniformization of hyperelliptic curves via Fuchsian differential equations (FDEs). This systematic process consists of the steps: 1) Obtaining the genus, g, by embedding a discrete memoryless channel (DMC) on a Riemann surface; 2) Select a set of symmetric points in the Poincar\'e disk to establish the hyperelliptic curve; 3) The Fuchsian group uniformizing region comes by the use of the FDE; 4) Quotients of the FDE linearly independent solutions, give rise to the generators of the associated Fuchsian group. Equivalently, this implies the determination of the decision region (Voronoi region) of a digital signal. Hence, the following results are achieved: 1) from the solutions of the FDE, the Fuchsian group generators are established. Since…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Polynomial and algebraic computation · Cryptography and Residue Arithmetic
