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

We show that on an $n=24m+8k$-dimensional even unimodular lattice, if theshortest vector length is $\geq 2m$, then as the number of vectors of length$2m$ decreases, the secrecy gain increases. We will also prove a similar resulton general unimodular lattices. Furthermore, assuming the conjecture byBelfiore and Sol\'e, we will calculate the difference between inverses ofsecrecy gains as the number of vectors varies. Finally, we will show by anexample that there exist two lattices in the same dimension with the sameshortest vector length and the same kissing number, but different secrecygains.

A short note on the kissing number of the lattice in Gaussian wiretap coding