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 present a new lower bound on the size of separating hashfamilies of type {w_1^{q-1},w_2} where w_1 < w_2. Our result extends the paperby Guo et al. on binary frameproof codes. This bound compares well againstknown general bounds, and is especially useful when trying to bound the size ofstrong separating hash families. We also show that our new bound is tight byconstructing hash families that meet the new bound with equality.

A tight bound on the size of certain separating hash families