English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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 ofcombinatorics and information theory, as data compression, compression withdistortion, broadcasting in interconnection network, write-once memory orsteganography (see \cite{Coh} and \cite{BF2008}). The full classification ofall the minimal 1-saturating sets in PG(2,9) and PG(2,11) and theclassification 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 acomputer-based exhaustive search that exploits projective equivalenceproperties.

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