• DocumentCode
    2944345
  • Title

    Primitive Quantum BCH Codes over Finite Fields

  • Author

    Aly, Salah A. ; Klappenecker, Andreas ; Sarvepalli, Pradeep Kiran

  • Author_Institution
    Dept. of Comput. Sci., Texas A&M Univ., College Station, TX
  • fYear
    2006
  • fDate
    9-14 July 2006
  • Firstpage
    1114
  • Lastpage
    1118
  • Abstract
    An attractive feature of BCH codes is that one can infer valuable information from their design parameters (length, size of the finite field, and designed distance), such as bounds on the minimum distance and dimension of the code. In this paper, it is shown that one can also deduce from the design parameters whether or not a primitive, narrow-sense BCH contains its Euclidean or Hermitian dual code. This information is invaluable in the construction of quantum BCH codes. A new proof is provided for the dimension of BCH codes with small designed distance, and simple bounds on the minimum distance of such codes and their duals are derived as a consequence. These results allow us to derive the parameters of two families of primitive quantum BCH codes as a function of their design parameters
  • Keywords
    BCH codes; Euclidean dual code; Hermitian dual code; finite fields; primitive quantum BCH codes; Computer science; Galois fields; Quantum computing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2006 IEEE International Symposium on
  • Conference_Location
    Seattle, WA
  • Print_ISBN
    1-4244-0505-X
  • Electronic_ISBN
    1-4244-0504-1
  • Type

    conf

  • DOI
    10.1109/ISIT.2006.261957
  • Filename
    4036138