Demo Data from EDBT 2026 / reviewers in the wild / expert
Edson Agustini
dblp:07/2447
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2005
0000-0001-8301-865XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › coded modulation
geometrically uniform codes |
0.0 | 1 | 2004 | Graphs, tessellations, and perfect codes on flat tori · IEEE Trans. Inf. Theory 2004 |
Coding theory › error-correcting codes
graph-based codes |
0.0 | 1 | 2004 | Graphs, tessellations, and perfect codes on flat tori · IEEE Trans. Inf. Theory 2004 |
Coding theory › error-correcting codes
perfect codes |
0.0 | 1 | 2004 | Graphs, tessellations, and perfect codes on flat tori · IEEE Trans. Inf. Theory 2004 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | "AWGN"-signal transmission in hyperbolic spacesabstractWe introduce and discuss the concept of Gaussian probability density function (pdf) for the n-dimensional hyperbolic space which has been proposed as an environment for coding and decoding signals. An upper bound for the error probability of signal transmission associated with the hyperbolic distance is established. The pdf and the upper bound were developed using Poincare models for the hyperbolic spaces Edson Agustini, Sueli I. Rodrigues Costa |
ISIT | 1 |
| 2004 | Graphs, tessellations, and perfect codes on flat toriabstractQuadrature amplitude modulation (QAM)-like signal sets are considered in this paper as coset constellations placed on regular graphs on surfaces known as flat tori. Such signal sets can be related to spherical, block, and trellis codes and may be viewed as geometrically uniform (GU) in the graph metric in a sense that extends the concept introduced by Forney . Homogeneous signal sets of any order can then be labeled by a cyclic group, induced by translations on the Euclidean plane. We construct classes of perfect codes on square graphs including Lee spaces, and on hexagonal and triangular graphs, all on flat tori. Extension of this approach to higher dimensions is also considered. Sueli I. Rodrigues Costa, M. Muniz, Edson Agustini, Reginaldo Palazzo Júnior |
IEEE Trans. Inf. Theory | 3 |