Xing-Ling codes, duals of their subcodes, and good asymmetric quantum codes

نویسندگان

  • Martianus Frederic Ezerman
  • Somphong Jitman
  • Patrick Solé
چکیده

A class of powerful q-ary linear polynomial codes originally proposed by Xing and Ling is deployed to construct good asymmetric quantum codes via the standard CSS construction. Our quantum codes are q-ary block codes that encode k qudits of quantum information into n qudits and correct up to b(dx−1)/2c bit-flip errors and up to b(dz−1)/2c phase-flip errors.. In many cases where the length (q2−q)/2≤ n≤ (q2 +q)/2 and the field size q are fixed and for chosen values of dx ∈ {2,3,4,5} and dz ≥ δ , where δ is the designed distance of the Xing-Ling (XL) codes, the derived pure q-ary asymmetric quantum CSS codes possess the best possible size given the current state of the art knowledge on the best classical linear block codes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A class of linear codes with good parameters from algebraic curves

A class of linear codes with good parameters is constructed in this correspondence. It turns out that linear codes of this class are subcodes of the subfield subcodes of Goppa’s geometry codes. In particular, we find 61 improvements on Brouwer’s table [1] based on our codes.

متن کامل

Quantum codes from affine variety codes and their subfield-subcodes

We use affine variety codes and their subfield-subcodes for obtaining quantum stabilizer codes via the CSS code construction. With this procedure we get codes with good parameters, some of them exceeding the quantum Gilbert-Varshamov bound given by Feng and Ma.

متن کامل

Subcodes of the Projective Generalized Reed-Muller Codes Spanned by Minimum-Weight Vectors

We use methods of Mortimer [19] to examine the subcodes spanned by minimumweight vectors of the projective generalized Reed-Muller codes and their duals. These methods provide a proof, alternative to a dimension argument, that neither the projective generalized Reed-Muller code of order r and of length q −1 q−1 over the finite field Fq of prime-power order q, nor its dual, is spanned by its min...

متن کامل

Quasi-cyclic subcodes of cyclic codes

We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration is equivalent to enumeration of certain vector subspaces in finite fields. In particular, we present enumeration results for quasi-cyclic subcodes of the si...

متن کامل

New binary and ternary LCD codes

LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field with cardinality larger than 3. Hence, the study of LCD codes is mainly open for binary and ternary fields. Subfield-subcodes of $J$-affine variety codes are a generalization of B...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 75  شماره 

صفحات  -

تاریخ انتشار 2015