Near MDS and near quantum MDS codes via orthogonal arrays

08/01/2023
by   Shanqi Pang, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/20/2018

New Quantum MDS codes constructed from Constacyclic codes

Quantum maximum-distance-separable (MDS) codes are an important class of...
research
02/13/2023

New Quantum MDS codes from Hermitian self-orthogonal generalized Reed-Solomon codes

Quantum maximum-distance-separable (MDS for short) codes are an importan...
research
08/03/2020

Near MDS codes from oval polynomials

A linear code with parameters of the form [n, k, n-k+1] is referred to a...
research
08/18/2022

Near-MDS Codes from Maximal Arcs in PG(2,q)

The singleton defect of an [n,k,d] linear code C is defined as s( C)=n-k...
research
03/18/2018

Two new classes of quantum MDS codes

Let p be a prime and let q be a power of p. In this paper, by using gene...
research
07/07/2022

Finite-rate sparse quantum codes aplenty

We introduce a methodology for generating random multi-qubit stabilizer ...
research
02/14/2020

Constructions of quantum MDS codes

Let F_q be a finite field with q=p^e elements, where p is a prime number...

Please sign up or login with your details

Forgot password? Click here to reset