Skip to main content

On Non-binary Quantum BCH Codes

  • Conference paper
Book cover Theory and Applications of Models of Computation (TAMC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3959))

Abstract

Two sufficient and necessary conditions for the self orthogonality of classical non-primitive BCH codes over \(\mathbb{F}_q\) and \(\mathbb{F}_{q^2}\) are given, respectively. And series of non-binary quantum BCH codes are obtained by using these two conditions and some construction methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Shor, P.: Polynomial-Time Algorithms For Prime Factorization and Discrete Logarithms. In: Proc. of the 35th Annual Symposium on Foundations of Computer Science(FOCS), pp. 124–134. IEEE Computer Society Press, Los Alamitos (1994)

    Chapter  Google Scholar 

  2. Grover, L.: A Fast Quantum Mechanical Algorithm For Database Search. In: Proc. 28th Annual ACM symposium on Theory of Computing(STOC), pp. 212–219. ACM, New York (1996)

    Google Scholar 

  3. Shor, P., Priskill, J.: Simple Proof of Security of The BB84 Quantum Key Distribution Protocol. Physical Review Letters 85, 441–444 (2000)

    Article  Google Scholar 

  4. Crépeau, C., Gottesman, D., Smith, A.: Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 285–301. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Ashikhmin, A., Knill, E.: Nonbinary Quantum Stabilizer Codes. IEEE Trans. Inform. Theory 47(7), 3065–3072 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Feng, K., Ma, Z.: A Finite Gilbert-Varshamov Bound for Pure Stabilizer Quantum Codes. IEEE Trans. Inform. Theory 50(12), 3323–3325 (2004)

    Article  MathSciNet  Google Scholar 

  7. Grassl, M., Beth, T.: On Optimal Quantum Codes. International Journal of Quantum Information 2(1), 55–64 (2004)

    Article  MATH  Google Scholar 

  8. Ketkar, A., Klappenecker, A., Kumar, S., Sarvepalli, P.K.: Nonbinary Stabilizer Codes over Finite Fields, quant-ph/0508070 (2005)

    Google Scholar 

  9. Steane, A.M.: Enlargement of Calderbank-Shor-Steane Quantum Codes. IEEE Trans. Inform. Theory 45(7), 2492–2495 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Calderbank, A., Rains, E., Shor, P., Sloane, N.: Quantum Error Correction via Codes over GF(4). IEEE Trans. Inform. Theory 44(7), 1369–1387 (1998)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ma, Z., Lu, X., Feng, K., Feng, D. (2006). On Non-binary Quantum BCH Codes. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_63

Download citation

  • DOI: https://doi.org/10.1007/11750321_63

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34021-8

  • Online ISBN: 978-3-540-34022-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics