English

Two families of Entanglement-assisted Quantum MDS Codes from cyclic Codes

Information Theory 2021-05-05 v1 math.IT

Abstract

With entanglement-assisted (EA) formalism, arbitrary classical linear codes are allowed to transform into EAQECCs by using pre-shared entanglement between the sender and the receiver. In this paper, based on classical cyclic MDS codes by exploiting pre-shared maximally entangled states, we construct two families of qq-ary entanglement-assisted quantum MDS codes [[q2+1a,q2+1a2(d1)+c,d;c]][[\frac{q^{2}+1}{a},\frac{q^{2}+1}{a}-2(d-1)+c,d;c]], where q is a prime power in the form of am+lam+l, and a=(l2+1)a=(l^2+1) or a=(l2+1)5a=\frac{(l^2+1)}{5}. We show that all of qq-ary EAQMDS have minimum distance upper limit much larger than the known quantum MDS (QMDS) codes of the same length. Most of these qq-ary EAQMDS codes are new in the sense that their parameters are not covered by the codes available in the literature.

Keywords

Cite

@article{arxiv.2011.12232,
  title  = {Two families of Entanglement-assisted Quantum MDS Codes from cyclic Codes},
  author = {Liangdong Lu and Wenping Ma and Ruihu Li and Hao Cao},
  journal= {arXiv preprint arXiv:2011.12232},
  year   = {2021}
}

Comments

arXiv admin note: substantial text overlap with arXiv:1803.04168, arXiv:1912.12031