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

Separating codes have their applications in collusion-secure fingerprintingfor generic digital data, while they are also related to the other structuresincluding hash family, intersection code and group testing. In this paper westudy upper bounds for separating codes. First, some new upper bound forrestricted separating codes is proposed. Then we illustrate that the UpperBound Conjecture for separating Reed-Solomon codes inherited from Silverberg'squestion holds true for almost all Reed-Solomon codes.

Upper Bounds on the Number of Codewords of Some Separating Codes