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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Symbol-pair codes introduced by Cassuto and Blaum in 2010 are designed toprotect against the pair errors in symbol-pair read channels. One of thecentral themes in symbol-error correction is the construction of maximaldistance separable (MDS) symbol-pair codes that possess the largest possiblepair-error correcting performance. In this paper, we construct more generalgenerator polynomials for two classes of MDS symbol-pair codes with code length$lp$. Based on repeated-root cyclic codes, we derive all MDS symbol-pair codesof length $3p$, when the degree of the generator polynomials is no more than10. We also give two new classes of (almost maximal distance separable) AMDSsymbol-pair codes with the length $lp$ or $4p$ by virtue of repeated-rootcyclic codes. For length $3p$, we derive all AMDS symbol-pair codes, when thedegree of the generator polynomials is less than 10.  The main results are obtained by determining the solutions of certainequations over finite fields.

MDS and AMDS symbol-pair codes are constructed from repeated-root codes