Gregory Duran Cunha

dblp:318/9533 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0002-1776-0183ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 since 2021

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
algebraic geometry code
0.612022
Weierstrass Pure Gaps on Curves With Three Distinguished Points · IEEE Trans. Inf. Theory 2022
Coding theory › error-correcting codes › convolutional codes › free distance
free distance optimization
0.612022
Weierstrass Pure Gaps on Curves With Three Distinguished Points · IEEE Trans. Inf. Theory 2022
Coding theory
algebraic curves
0.212022
Weierstrass Pure Gaps on Curves With Three Distinguished Points · IEEE Trans. Inf. Theory 2022

Methods — techniques the papers use, named apart from their topics

divisor theory · 0.6
YearPublicationVenuePosition
2022 Weierstrass Pure Gaps on Curves With Three Distinguished Points
abstract
Let $ \mathbb K$ be an algebraically closed field. In this paper, we consider the class of smooth plane curves of degree $n+1>3$ over $ \mathbb K$ , containing three points, $P_{1},P_{2}$ , and $P_{3}$ , such that $nP_{1}+P_{2}$ , $nP_{2}+P_{3}$ , and $nP_{3}+P_{1}$ are divisors cut out by three distinct lines. For such curves, we determine the dimension of certain special divisors supported on $\{P_{1},P_{2},P_{3}\}$ , as well as an explicit description of all pure gaps at each nonempty subset of the distinguished points $P_{1},P_{2}$ , and $P_{3}$ . When $ \mathbb K=\overline { \mathbb F}_{q}$ , this class of curves, which includes the Hermitian curve, is used to construct algebraic geometry codes having minimum distance better than the Goppa bound.
Herivelto Martins Borges Filho, Gregory Duran Cunha
IEEE Trans. Inf. Theory2