Constructions of quantum MDS codes

02/14/2020
by   Hualu Liu, et al.
0

Let F_q be a finite field with q=p^e elements, where p is a prime number and e ≥ 1 is an integer. In this paper, by means of generalized Reed-Solomon (GRS) codes, we construct two new classes of quantum maximum-distance-separable ( quantum MDS) codes with parameters [[q + 1, 2k-q-1, q-k+2]]_q for q+2/2≤ k≤ q+1, and [[n,2k-n,n-k+1]]_q for n≤ q and n/2≤ k≤ n. Our constructions improve and generalize some results of available in the literature. Moreover, we give an affirmative answer to the open problem proposed by Fang et al. in <cit.>.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
01/06/2020

Two new classes of quantum MDS codes from generalized Reed-Solomon codes

In this paper, we mainly use classical Hermitian self-orthogonal general...
research
04/29/2019

New Quantum Generalized Reed-Solomn Codes over Finite Fields

In this paper, we present five new classes of q-ary quantum MDS codes ut...
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
04/23/2018

Some New Constructions of Quantum MDS Codes

It is an important task to construct quantum MDS codes with good paramet...
research
08/01/2023

Near MDS and near quantum MDS codes via orthogonal arrays

Near MDS (NMDS) codes are closely related to interesting objects in fini...
research
02/19/2020

A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet

Recently, Cohen, Haeupler and Schulman gave an explicit construction of ...

Please sign up or login with your details

Forgot password? Click here to reset