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 this paper, we obtain sufficient and necessary conditions for quasi-cycliccodes with index even to be symplectic self-orthogonal. Then, we propose amethod for constructing symplectic self-orthogonal quasi-cyclic codes, whichallows arbitrary polynomials that coprime $x^{n}-1$ to construct symplecticself-orthogonal codes. Moreover, by decomposing the space of quasi-cycliccodes, we provide lower and upper bounds on the minimum symplectic distances ofa class of 1-generator quasi-cyclic codes and their symplectic dual codes.Finally, we construct many binary symplectic self-orthogonal codes withexcellent parameters, corresponding to 117 record-breaking quantum codes,improving Grassl's table (Bounds on the Minimum Distance of Quantum Codes.http://www.codetables.de).

Symplectic self-orthogonal quasi-cyclic codes