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

Based on a relationship between generator matrix of given code and its weight distribution, all [31s+t, 3] 5(t=7, 13, 19, 25) optimal divisible codes with divisor 5 are determined by solving systems of linear equations. Then their generator matrices and weight polynomials of these optimal divisible codes are also given. Index Terms Weight Distributions, divisible codes, Griesmer Bound

Weight Distributions of Divisible Codes Meeting the Griesmer Bound over F5 with Dimension 3