Advanced search
Start date
Betweenand

Finite geometry, Algebraic curves and Applications to Coding Theory

Grant number: 12/03526-0
Support Opportunities:Scholarships in Brazil - Post-Doctoral
Effective date (Start): October 01, 2012
Effective date (End): September 11, 2015
Field of knowledge:Physical Sciences and Mathematics - Mathematics - Algebra
Principal Investigator:Herivelto Martins Borges Filho
Grantee:Nicola Pace
Host Institution: Instituto de Ciências Matemáticas e de Computação (ICMC). Universidade de São Paulo (USP). São Carlos , SP, Brazil

Abstract

Finite Geometry and its applications have been widely investigated since the 1960's. However, the study of non-linear objects was started by Beniamino Segre already in the 1950's. His pioneering work put the basis for studying objects like ovals, unitals, arcs, caps, ovoids, and partitions in subgeometries. Segre's work lead to a further extensive research and many questions are still open and deeply investigated.In this project, we propose a study of non-linear combinatorial objects with a particular emphasis to methods using algebraic curves over finite fields. In particular, we plan to investigate the following topics. 1. Algebraic curves arising from large arcs via Segre's approach conjecture. We plan to work on both large and small complete arcs; in particular, arcs which are orbits of a large projectivity group. In this project, we will investigate the geometric features of the orbits of some sporadic groups, such as A5, A6 and PSL(2,7). Interestingly, the stabilizer of a point of an element of order 4 in PSL(2,7), viewed as a projectivity group of PG(2,q), is a 42-arc apart from some sporadic values of q. Similar results might hold for A5 and A6, and our aim is to investigate this problem. We plan to study the problem of the existence of (q-1)-complete arcs in PG(2,q). These arcs are known to exists for small values of q (q=7,9,11,13) and they do not exist for q>79. In our project, we plan to investigate the remaining open cases. Furthermore, we will try to determine the plane curves associated to known complete large arcs.2. Algebraic curves and (k,n)-arcs.We will concentrate on (k,n)-arcs arising from plane curves. Since very little is known about (k,n)-arcs except in the extremal cases of n=2,3,q-1,q, we also aim to improve the knowledge of the intermediate cases. Possibly, we will provide new constructions and study the corresponding linear codes. Based on the Hermitian case and other sporadic examples, it is natural to ask whether or not all plane non-singular maximal curves have the arc property. Answering this question is also part of our goals in this topic of our investigation.3. Arcs and unitals in PG(2,q) and their applications to linear codes, MDS codes, near-MDS codes.Near-MDS codes can be investigated within finite projective geometry, since an [n, k]_q near-MDS code can be viewed as a point-set C of size n in PG(k-1,q), q=p^h, p prime, h=1, satisfying the following conditions:a) every k-1 points in C uniquely determine a hyperplane of PG(k-1,q); b) there exist k points in C lying in a hyperplane of PG(k-1,q);c) any k+1 points in C span PG(k-1, q).Using this approach, Abatangelo et al. analyzed the case k=6,q=5. We plan to use this approach to investigate the same problem for other small fields. We will also try the same approach for further (small) values of k.Finally, we plan to study Goppa codes whose underline curve has a large automorphism group. This property seems to constitute an advantage in developing efficient permutation decoding algorithms for codes. Goppa codes are candidates to be codes with many automorphisms, since every automorphism of the curve fixing the divisor D and the Riemann-Roch space L(G) in Goppa's construction is inherited, that is, it is lifted to an automorphism of the corresponding Goppa code. In our project, we will study these algebraic properties in known examples.These topics will be investigated by using geometric, combinatorial and group theoretical methods. Moreover, the nature of this investigation will require the use of specialized software, such as GAP and Magma, and the development of ad-hoc libraries and subroutines for verifying our conjectures and studying particular cases.

News published in Agência FAPESP Newsletter about the scholarship:
More itemsLess items
Articles published in other media outlets ( ):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Scientific publications (7)
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
KORCHMAROS, GABOR; PACE, NICOLA. Coset intersection of irreducible plane cubics. DESIGNS CODES AND CRYPTOGRAPHY, v. 72, n. 1, SI, p. 53-75, . (12/03526-0)
KORCHMAROS, GABOR; NAGY, GABOR P.; PACE, NICOLA. 3-Nets realizing a group in a projective plane. JOURNAL OF ALGEBRAIC COMBINATORICS, v. 39, n. 4, p. 939-966, . (12/03526-0)
KORCHMAROS, GABOR; NAGY, GABOR P.; PACE, NICOLA. k-nets embedded in a projective plane over a field. COMBINATORICA, v. 35, n. 1, p. 63-74, . (12/03526-0)
PACE, NICOLA. On Small Complete Arcs and Transitive A(5)-Invariant Arcs in the Projective Plane PG(2, q). JOURNAL OF COMBINATORIAL DESIGNS, v. 22, n. 10, p. 425-434, . (12/03526-0)
PACE, NICOLA. New ternary linear codes from projectivity groups. DISCRETE MATHEMATICS, v. 331, p. 22-26, . (12/03526-0)
PACE, NICOLA; SONNINO, ANGELO. On linear codes admitting large automorphism groups. DESIGNS CODES AND CRYPTOGRAPHY, v. 83, n. 1, p. 115-143, . (12/03526-0)
KORCHMAROS, GABOR; PACE, NICOLA. Coset intersection of irreducible plane cubics. DESIGNS CODES AND CRYPTOGRAPHY, v. 72, n. 1, p. 23-pg., . (12/03526-0)

Please report errors in scientific publications list using this form.