Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 23 Nov 2020 in cs.IT and math.IT | (2011.12232v1)

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 $q$-ary entanglement-assisted quantum MDS codes $[[\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+l$, and $a=(l2+1)$ or $a=\frac{(l2+1)}{5}$. We show that all of $q$-ary EAQMDS have minimum distance upper limit much larger than the known quantum MDS (QMDS) codes of the same length. Most of these $q$-ary EAQMDS codes are new in the sense that their parameters are not covered by the codes available in the literature.

Citations (5)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (4)

Collections

Sign up for free to add this paper to one or more collections.