Singularities as generators of signal constellations and hyperbolic triangles
DOI:
https://doi.org/10.14393/BEJOM-v6-2025-73876Keywords:
Geometrically uniform codes, Fuchsian equations, communication channelsAbstract
In this work, three regular singularities of fuchsian differential equations will be considered, one of them being infinity, as generators of signal constellations and as vertices of a hyperbolic polygon, in order to establish a connection with error analysis in a discrete memoryless channel and in a geometrically uniform code. The procedure is based on the following steps: given two complex points and the infinite: (1) consider these points as singularities of a fuchsian differential equation; (2) generate constellations of signals on the complex plane from the obtained singularities; (3) consider the existence of a perfect or quasi-perfect code on the signals constellation and their ability to correct errors; (4) analyze these singularities as vertices of a hyperbolic triangle to identify the genus of the associated surface, through the pairings of the sides of this triangle; (5) verify which channel is associated with the same genus, and thus represent the vertices of the hyperbolic triangle as channel inputs and outputs; (6) analyze the channel associated with the codewords to verify the error probability of the transmitted singularity. Through the results obtained, it can be concluded that singularities with the opposite real part generate perfect and/ or quasi-perfect codes with the same ability to correct errors. It was possible to represent the codewords as inputs and outputs of a discrete memoryless channel, showing that the probability of error, p, is related to the number of codewords on the constellation. When considering singularities as vertices of a hyperbolic triangle, a connection was established with the symmetric binary channel C2.2, whose inputs and outputs represent pairs of opposite singularities relative to the imaginary axis. The established connections can be applied to error analysis in an information transmission process.
Downloads
References
C. E. Shannon. “A Mathematical Theory of Communication”. Em: The Bell System Technical Journal 27 (1948), pp. 379–423.
G. D. Forney. “Geometrically Uniform Codes”. Em: IEEE Transactions on Information Theory 37 (1991), pp. 1241–1260.
C. Martinez, R. Beivide e E. Gabidulin. “Perfect Codes for Metrics Induced by Circulant Graphs”. Em: IEEE Transactions on Information Theory 53 (2007), pp. 3042–3052.
C. R. O. Q. Queiroz. “C´odigos geometricamente uniformes derivados de grafos sobre an´eis quocientes de inteiros e de ordens dos quatérnios”. Tese de Doutorado. Universidade Estadual de Campinas, Faculdade de Engenharia El´etrica e de Computac¸ ˜ao, 2011.
J. Vaz Jr. e E. Capelas de Oliveira. M´etodos Matem´aticos - Volume 1. 1ª ed. Campinas: Editora da Unicamp, 2016.
C. Walkden. Hyperbolic Geometry. Manchester: Manchester University, 2012.
A. J. Oliveira. “Uniformização de curvas alg´ebricas associadas a sequˆencias de Farey atrav´es de equações diferenciais fuchsianas na proposta de novos sistemas de comunicação”. Tese de Doutorado. Universidade Estadual de Campinas, Faculdade de Engenharia El´etrica e de Computação, 2017.
A. J. Oliveira e R. Palazzo Jr. “Geometric and algebraic structures associated with the channel quantization problem”. Em: Computational and Applied Mathematics 37 (2018), pp. 2218–2236.
M. Firer. Grupos Fuchsianos. Notas de Aula, IMECC-UNICAMP, 2001.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Mariana Gabriela Gusmão, Anderson José de Oliveira

This work is licensed under a Creative Commons Attribution 4.0 International License.
- Articles published from 2025 onwards are licensed under the CC BY 4.0 license. By submitting material for publication, authors automatically agree to the journal’s editorial guidelines and affirm that the text has been properly reviewed. Simultaneous submission of articles to other journals is prohibited, as is the translation of articles published in this journal into another language without proper authorization.
- Articles published prior to 2025 are licensed under the CC BY-NC 4.0 license.