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

In this paper, we study the bound on three kinds of hash family using theSingleton bound. To $\epsilon-U(N; n, m)$ hash family, in the caes of $n>m^2>1$and $1\geq\epsilon\geq \epsilon_1(n, m)$, we get that the new bound is better.To $\epsilon-\bigtriangleup U(N; n, m)$ hash family, in the case of $n>m>1$ and$1\geq\epsilon\geq\epsilon_3(n,m)$, the new bound is better. To $\epsilon-SU(N;n, m)$ hash family, in the case of $n>2^m>2$ and $1\geq\epsilon\geq\epsilon_4(n, m)$, we get that the new bound is better.

The Improvement of the Bound on Hash Family