Primitive quantum BCH codes over finite fields Academic Article uri icon

abstract

  • An attractive feature of BCH codes is that one can infer valuable information from their design parameters (length, size of the finite held, 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. 2006 IEEE.

published proceedings

  • 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS

author list (cited authors)

  • Aly, S. A., Klappenecker, A., & Sarvepalli, P. K.

citation count

  • 46

complete list of authors

  • Aly, Salah A||Klappenecker, Andreas||Sarvepalli, Pradeep Kiran

publication date

  • July 2006