Table of Contents
Fetching ...

Near MDS and near quantum MDS codes via orthogonal arrays

Shanqi Pang, Chaomeng Zhang, Mengqian Chen, Miaomiao Zhang

TL;DR

By using symmetrical orthogonal arrays (OAs), by using symmetrical orthogonal arrays (OAs), a lot of NMDS, m-MDS and almost extremal NMDS codes are constructed.

Abstract

Near MDS (NMDS) codes are closely related to interesting objects in finite geometry and have nice applications in combinatorics and cryptography. But there are many unsolved problems about construction of NMDS codes. In this paper, by using symmetrical orthogonal arrays (OAs), we construct a lot of NMDS, $m$-MDS and almost extremal NMDS codes. We establish a relation between asymmetrical OAs and quantum error correcting codes (QECCs) over mixed alphabets. Since quantum maximum distance separable (QMDS) codes over mixed alphabets with the dimension equal to one have not been found in all the literature so far, the definition of a near quantum maximum distance separable (NQMDS) code over mixed alphabets is proposed. By using asymmetrical OAs, we obtain many such codes.

Near MDS and near quantum MDS codes via orthogonal arrays

TL;DR

By using symmetrical orthogonal arrays (OAs), by using symmetrical orthogonal arrays (OAs), a lot of NMDS, m-MDS and almost extremal NMDS codes are constructed.

Abstract

Near MDS (NMDS) codes are closely related to interesting objects in finite geometry and have nice applications in combinatorics and cryptography. But there are many unsolved problems about construction of NMDS codes. In this paper, by using symmetrical orthogonal arrays (OAs), we construct a lot of NMDS, -MDS and almost extremal NMDS codes. We establish a relation between asymmetrical OAs and quantum error correcting codes (QECCs) over mixed alphabets. Since quantum maximum distance separable (QMDS) codes over mixed alphabets with the dimension equal to one have not been found in all the literature so far, the definition of a near quantum maximum distance separable (NQMDS) code over mixed alphabets is proposed. By using asymmetrical OAs, we obtain many such codes.
Paper Structure (8 sections, 14 theorems, 6 equations, 2 tables)

This paper contains 8 sections, 14 theorems, 6 equations, 2 tables.

Key Result

Lemma 2.1

SPang2019 The minimal distance of an ${\rm OA}(s^k, n, s, k)$ is $n-k+1$ for $s\geq2$ and $k\geq1$.

Theorems & Definitions (30)

  • Definition 2.1
  • Definition 2.2
  • Definition 2.3
  • Definition 2.4
  • Lemma 2.1
  • Lemma 2.2
  • proof
  • Remark 2.1
  • Lemma 2.3
  • Lemma 2.4
  • ...and 20 more