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

DOI10.1007/S10773-021-04802-3MaRDI QIDQ6354476arXivFDO

Authors Liang-Dong Lü, Wen-Ping Ma, Ruihu Li, Hao Cao, Jinshen Ren

Publication date 23 November 2020

Mathematics Subject Classification ID

Quantum coding (general) (81P70) Cyclic codes (94B15) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)

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+1a,frac{q}^2+1a-2(d-1)+c,d;c]]$, where q is a prime power in the form of $am+l$, and $a=(l^2+1)$ or $a=frac(l^2+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.

This page was built for publication: Two families of Entanglement-assisted Quantum MDS Codes from cyclic Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6354476)