Skip to main content
SpringerLink
Log in
Book cover

Coding Theory and Applications pp 56–68Cite as

Classic and Quantum Error Correcting Codes

  • Conference paper

  • 745 Accesses

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

Abstract

Algebraic methods play an important role in coding theory. For instance, there are many connections between codes and groups. In this paper we will present two results that show different applications of algebraic methods in coding theory. One of them refers to the classical context and another one to the quantum error correcting theory. These results can be found in [5] and [13] respectively, where proofs and more details can be found.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ashikhmin, A., Knill, E.: Nonbinary quantum stabilizer codes. IEEE Trans. Inform. Theory 47, 3065–3072 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bosma, W., Cannon, J.J., Playoust, C.: The Magma algebra system I: The user language. J. Symb. Comp. 24, 235–266 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brouwer, A.E.: Bounds on linear codes. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, pp. 295–461. Elsevier, Amsterdam (1998)

    Google Scholar 

  4. Interlando, J.C., Palazzo, R., Elia, M.: Group Block Codes over Non Abelian Groups are Asymptotically Bad. IEEE Transactions on Information Theory 48(4), 1277–1280 (1996)

    Article  MathSciNet  Google Scholar 

  5. Couselo, E., González, S., Martínez, C., Markov, V., Nechaev, A.: Some constructions of linearly optimal group codes (submitted)

    Google Scholar 

  6. Couselo, E., Gonzalez, S., Markov, V., Nechaev, A.: Recursive MDS-codes and recursively differentiable k-quasigroups. In: Proceedings of the Sixth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT-VI), pp. 78–84 (1998)

    Google Scholar 

  7. Couselo, E., Gonzalez, S., Markov, V., Nechaev, A.: Linear Recursive MDS-Codes and Asturian codes. In: International workshop on coding and cryptography, paris, pp. 142–149 (2001)

    Google Scholar 

  8. Couselo, E., Gonzalez, S., Markov, V., Nechaev, A.: “Loop codes”. Discr. Math. and Appl. 14(2), 163–172 (2004)

    Article  Google Scholar 

  9. Curtis, C.W., Reiner, I.: Representation of finite groups and associative algebras. Wiley (Interscience), New York (1962)

    MATH  Google Scholar 

  10. DeMeyer, F.R., Janusz, G.J.: Finite Groups with an Irreducible Representation of Large Degree. Math. Z. 108, 145–153 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  11. David Forney Jr., G.: On Hamming Distance Properties of Group Codes. IEEE Transactions on Information Theory 38(6), 1797–1801 (1992)

    Article  MATH  Google Scholar 

  12. Grassl, M.: Searching for linear codes with large minimum distance. In: Bosma, W., Cannon, J. (eds.) Discovering Mathematics with Magma. Springer, Heidelberg (2006)

    Google Scholar 

  13. Grassl, M., Martínez, C., Nicolás, A.P.: Clifford codes and fully ramified characters (submitted)

    Google Scholar 

  14. Heise, W., Quattrocci, P.: Informations- und codierungstheorie. Springer, Heidelberg (1995)

    MATH  Google Scholar 

  15. Howlett, R.B., Martin Isaacs, I.: On Groups of Central Type. Math. Z. 179, 555–569 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  16. Martin Isaacs, I.: Character Theory of Finite Groups. Academic Press, London (1976)

    MATH  Google Scholar 

  17. Klappenecker, A., Rötteler, M.: Beyond Stabilizer Codes I: Nice Error Basis. IEEE Transactions on Information Theory 48(8), 2392–2395 (2002)

    Article  MATH  Google Scholar 

  18. Klappenecker, A., Rötteler, M.: Beyond Stabilizer Codes II: Clifford codes. IEEE Transactions on Information Theory 48(8), 2396–2399 (2002)

    Article  MATH  Google Scholar 

  19. Klappenecker, A., Rötteler, M.: On the structure of nonstabilizer Clifford codes. Quantum Inf. Comput. 4(2), 152–160 (2004)

    MathSciNet  Google Scholar 

  20. Lambek, J.: Lectures on Rings and Modules. McGill Univ., Blaisdell Publ. Co. (1966)

    Google Scholar 

  21. Lang, S.: “Algebra”. Colambia Univ., Addisson–Wesley, Reading (1965)

    Google Scholar 

  22. Lidl, R., Niederreiter, H.: “Finite fields”. Addison –Wesley, Reading (1983)

    Google Scholar 

  23. MacWilliams, F.J., Sloane, N.J.A.: The theory of Error-Correcting Codes, vol. 16. Elsevier Science Publishers, B.V., North Holland Mathematical Library (1988)

    Google Scholar 

  24. Sabin, R.E., Lomonaco, S.J.: Metacyclic error-correcting codes. Appl. Algebra Eng. Commun. Comput. 6(3), 191–210 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  25. Sabin, R.E.: On determining all codes in semi-simple group rings. In: Cohen, G., et al. (eds.) AAECC 1993. LNCS, vol. 673, pp. 279–290. Springer, Heidelberg (1993)

    Google Scholar 

  26. Sabin, R.E.: An ideal structure for some quasi-cyclic error-correcting codes. In: Mullen, G.L., et al. (eds.) Finite fields, coding theory, and advances in communications and computing. Proceedings of the international conference on finite fields, coding theory, and advances in communications and computing, University of Nevada, Las Vegas, USA, August 7-10, 1991. Lect. Notes Pure Appl. Math., vol. 141, pp. 183–194. Marcel Dekker, Inc., New York (1993)

    Google Scholar 

  27. Shahriari, S.: On Central type factor groups. Pacific Journal of Mathematics 1, 151–178 (1991)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidad de Oviedo, Spain

    Santos González & Consuelo Martínez

  2. Universidad de Cantabria, Spain

    Alejandro P. Nicolás

Authors
  1. Santos González
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Consuelo Martínez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alejandro P. Nicolás
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ángela Barbero

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

González, S., Martínez, C., Nicolás, A.P. (2008). Classic and Quantum Error Correcting Codes. In: Barbero, Á. (eds) Coding Theory and Applications. Lecture Notes in Computer Science, vol 5228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87448-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87448-5_7

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation