Sign Up to like & get
recommendations!
0
Published in 2019 at "Journal of Combinatorial Designs"
DOI: 10.1002/jcd.21672
Abstract: An (n,r)-arc in PG(2,q) is a set of n points such that each line contains at most r of the selected points. It is well-known that (n,r)-arcs in PG(2,q) correspond to projective linear codes. Let…
read more here.
Keywords:
bounds size;
size arcs;
lower bounds;
new lower ... See more keywords