Classification of minimal 1-saturating sets in $PG(2,q)$, $q\leq 23$

Details Classification of minimal 1-saturating sets in $PG(2,q)$, $q\leq 23$ Classification of minimal 1-saturating sets in $PG(2,q)$, $q\leq 23$

2012-03-06

arxiv.org/abs/1203.1133v1

Mathematics

Combinatorics

4 pages

Scientific paper

Minimal 1-saturating sets in the projective plane $PG(2,q)$ are considered. They correspond to covering codes which can be applied to many branches of combinatorics and information theory, as data compression, compression with distortion, broadcasting in interconnection network, write-once memory or steganography (see \cite{Coh} and \cite{BF2008}). The full classification of all the minimal 1-saturating sets in PG(2,9) and PG(2,11) and the classification of minimal 1-saturating sets of smallest size in PG(2,q), $16\leq q\leq 23$ are given. These results have been found using a computer-based exhaustive search that exploits projective equivalence properties.

Affiliated with

Also associated with

No associations

Rating

Classification of minimal 1-saturating sets in $PG(2,q)$, $q\leq 23$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Classification of minimal 1-saturating sets in $PG(2,q)$, $q\leq 23$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classification of minimal 1-saturating sets in $PG(2,q)$, $q\leq 23$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-537030