• DocumentCode
    57758
  • Title

    A Construction of New Quantum MDS Codes

  • Author

    Lingfei Jin ; Chaoping Xing

  • Author_Institution
    Sch. of Comput. Sci., Shanghai Key Lab. of Intell. Inf. Process., Fudan Univ., Shanghai, China
  • Volume
    60
  • Issue
    5
  • fYear
    2014
  • fDate
    May-14
  • Firstpage
    2921
  • Lastpage
    2925
  • Abstract
    It has been a great challenge to construct new quantum maximum-distance-separable (MDS) codes. In particular, it is very hard to construct the quantum MDS codes with relatively large minimum distance. So far, except for some sparse lengths, all known q-ary quantum MDS codes have minimum distance ≤q/2 + 1. In this paper, we provide a construction of the quantum MDS codes with minimum distance >q/2 + 1. In particular, we show the existence of the q-ary quantum MDS codes with length n = q2 + 1 and minimum distance d for any d q + 1 (this result extends those given in the works of Guardia (2011), Jin et al. (2010), and Kai an Zhu (2012)); and with length (q2 + 2)/3 and minimum distance d for any d (2q+2)/3 if 3|(q + 1). Our method is through Hermitian selforthogonal codes. The main idea of constructing the Hermitian self-orthogonal codes is based on the solvability in Fq of a system of homogenous equations over Fq2.
  • Keywords
    codes; quantum computing; Hermitian self-orthogonal codes; minimum distance; quantum MDS codes; quantum maximum distance separable codes; Educational institutions; Equations; Linear codes; Quantum mechanics; Reed-Solomon codes; Vectors; Hermitian inner product; MDS codes; Self-orthogonal; generalized Reed-Solomon codes; maximum-distance-separable (MDS) codes; quantum codes; self-orthogonal;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2014.2299800
  • Filename
    6710144