Learn More
It is possible to construct an entanglement-assisted quantum error-correcting (EAQEC, for short) code from any classical linear code. However, the parameter of ebits c is usually calculated by computer search. In this work, we can construct a family of [[2n − k, k,≥ d; c]] EAQEC codes from arbitrary binary [n, k, d] linear codes, where the parameter of(More)
Entanglement-assisted quantum error-correcting codes are not only theoretically interesting, but also of great importance in practical physically applications. In this work, two class of entanglement-assisted quantum codes are constructed. The first class of entanglement-assisted quantum codes is minimal ebits entanglement-assisted quantum codes, which(More)
Motivated by the work of Dougherty, Ling and Betsumiya, we define type II codes over R = F<sub>2</sub> + uF<sub>2</sub> + u<sup>2</sup>F <sub>2</sub> as self-dual codes with Lee weights a multiple of 4. A new Gray map between codes over R and codes over F<sub>2</sub> is defined. The existence of self-dual code over R is examined. Properties of the Gray map(More)
Self-dual codes are an important class of codes. They have interesting connections to design theory, lattices theory and invariant theory. In this work, we generalize our result of [15] to finite chain rings R, and define Type II codes over finite chain rings R. A new Gray map between codes over finite chain rings R and codes over F<sub>2</sub> is defined.(More)
  • Jianfa Qian
  • 2011 7th International Conference on Wireless…
  • 2011
A new Gray map between codes over finite rings &#36;R=F_2+uF_2+u^2F_2&#36; and codes over &#36;F_2&#36; is defined. We prove that the Gray image of a linear &#36;(1+u+u^2)&#36;-cyclic code over &#36;R&#36; of length &#36;n&#36; is a binary distance invariant linear cyclic code. We also prove that, if &#36;n&#36; is odd, then every binary code which is the(More)
  • 1