Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Entanglement-assisted quantum MDS codes from constacyclic codes with large minimum distance (1803.04168v1)

Published 12 Mar 2018 in cs.IT and math.IT

Abstract: The entanglement-assisted (EA) formalism allows arbitrary classical linear codes to transform into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver. In this work, we propose a decomposition of the defining set of constacyclic codes. Using this method, we construct four classes of $q$-ary entanglement-assisted quantum MDS (EAQMDS) codes based on classical constacyclic MDS codes by exploiting less pre-shared maximally entangled states. We show that a class of $q$-ary EAQMDS have minimum distance upper limit greater than $3q-1$. Some of them have much larger minimum distance 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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Liangdong Lu (10 papers)
  2. Wenping Ma (25 papers)
  3. Ruihu Li (22 papers)
  4. Yuena Ma (2 papers)
  5. Yang Liu (2256 papers)
  6. Hao Cao (22 papers)
Citations (68)

Summary

We haven't generated a summary for this paper yet.