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

Conflict-avoiding codes (CACs) have been used in multiple-access collisionchannel without feedback. The size of a CAC is the number of potential usersthat can be supported in the system. A code with maximum size is calledoptimal. The use of an optimal CAC enables the largest possible number ofasynchronous users to transmit information efficiently and reliably. In thispaper, a new upper bound on the maximum size of arbitrary equi-difference CACis presented. Furthermore, three optimal constructions of equi-difference CACsare also given. One is a generalized construction for prime length $L=p$ andthe other two are for two-prime length $L=pq$.

A new upper bound and optimal constructions of equi-difference conflict-avoiding codes on constant weight