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

We derive upper and lower bounds on the sum of distances of a spherical codeof size $N$ in $n$ dimensions when $N\sim n^\alpha, 0<\alpha\le 2.$ The boundsare derived by specializing recent general, universal bounds on energy ofspherical sets. We discuss asymptotic behavior of our bounds along with severalexamples of codes whose sum of distances closely follows the upper bound.

Bounds for the sum of distances of spherical sets of small size