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

The minimum distance graph of an extended Preparata code P(m) has verticescorresponding to codewords and edges corresponding to pairs of codewords thatare distance 6 apart. The clique structure of this graph is investigated and itis established that the minimum distance graphs of two extended Preparata codesare isomorphic if and only if the codes are equivalent.

On the minimum distance graph of an extended Preparata code