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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Let R = Fq + uFq + vFq + uvFq, with u2 = u, v2 = v, uv = vu, where q = pm for a positive integer m and an odd prime p. We study the algebraic structure of FqR-cyclic codes of block length (r, s). These codes can be viewed as R[x]-submodules of Fq[x]/(xr - 1) &#x00D7; R[x]/(xs - 1). For this family of codes we discuss the generator polynomials and minimal generating sets. We study the algebraic structure of separable codes. Further, we discuss the duality of this family of codes and determine their generator polynomials. We obtain several optimal and near-optimal codes from this study. As applications, we discuss a construction of quantum error-correcting codes (QECCs) from FqR-cyclic codes and construct some good QECCs.

A Study of FqR-Cyclic Codes and Their Applications in Constructing Quantum Codes

A Study of F_qR-Cyclic Codes and Their Applications in Constructing Quantum Codes