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 2002, Tonchev first constructed some linear binary codes defined by theadjacency matrices of undirected graphs. So, graph is an important tool forsearching optimum codes. In this paper, we introduce a new method of searching(proposed) optimum formally self-dual linear binary codes from circulantgraphs.

Formally self-dual linear binary codes from circulant graphs