Lower Bound for m3(2,37) and Related Code
Main Article Content
Abstract
In a finite projective plane PG(2, q), an (k, n)-arc is a set of k points of a projective plane such that some n, but no
n + 1 of them, are collinear. Here, the integer n is the degree of the arc and k ≥ n. The maximum size of an (k,n)-arc in
PG(2,q) is denoted by mn(2,q). In this paper the classification of the (k,3)-arcs in PG(2,37) is presented. It has been obtained
using a computer-based exhaustive search that exploits Secant distributions inequivalent (k,3)-arcs and produces exactly one
representative of each equivalence class. We established that 50 ≤ m3(2,37). The constructed (50,3)-arcs give the respective
lower bounds on m3(2,37). As a consequence there exist new three-dimensional linear codes over GF(37).
Downloads
Metrics
Article Details
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
