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/

Zendy Plus

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

Zendy Tools

Zendy Open

For a type-I $(K,M,Z,N)$-ZCCS, it follows $K \leq M \left\lfloor\frac{N}{Z}\right\rfloor$. In this paper, we propose a construction of type-II$(p^{k+n},p^k,p^{n+r}-p^r+1,p^{n+r})$-$Z$ complementary code set (ZCCS) usingan extended Boolean function, its properties of Hamiltonian paths and theconcept of isolated vertices, where $p\ge 2$. However, the proposed type-IIZCCS provides $K = M(N-Z+1)$ codes, where as for type-I $(K,M,N,Z)$-ZCCS, it is$K \leq M \left\lfloor \frac{N}{Z}\right\rfloor$. Therefore, the proposedtype-II ZCCS provides a larger number of codes compared to type-I ZCCS.Further, as a special case of the proposed construction, $(p^k,p^k,p^n)$-CCCcan be generated, for any integral value of $p\ge2$ and $k\le n$.

A Construction of Arbitrarily Large Type-II $Z$ Complementary Code Set