A Family of Constacyclic Codes over 𝔽 2 m + u 𝔽 2 m and Its Application to Quantum Codes

Yongsheng Tang, Ting Yao, Shixin Zhu, Xiaoshan KaiChinese 2020 · DOI

Abstract

Let R be the ring 𝔽2m + u𝔽2m, where u2 = 0. We introduce a Gray map from R to 𝔽22m and study (1 + u)-constacyclic codes over R. It is proved that the image of a (1 + u)-constacyclic code length n over R under the Gray map is a distance-invariant binary quasicyclic code of index m and length 2mn. We also prove that every code of length 2mn which is the Gray image of cyclic codes over R of length n is permutation equivalent to a binary quasi-cyclic code of index m. Furthermore, a family of quantum error-correcting codes obtained from the Calderbank-Shor-Steane (CSS) construction applied to (1 + u)-constacyclic codes over R.
BibTeX
@inproceedings{tang2020family,
  author = {Yongsheng Tang and Ting Yao and Shixin Zhu and Xiaoshan Kai},
  title = {{A Family of Constacyclic Codes over 𝔽 <sub>2</sub> <sup> <i>m</i> </sup> + <i>u</i> 𝔽 <sub>2</sub> <sup> <i>m</i> </sup> and Its Application to Quantum Codes}},
  booktitle = {Chinese},
  year = {2020},
  doi = {10.1049/cje.2019.10.007},
}

Loading related content...

Figure