Skip to main content
SpringerLink
Log in

A General Framework for Applying FGLM Techniques to Linear Codes

  • Conference paper
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2006)

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

Abstract

We show herein that a pattern based on FGLM techniques can be used for computing Gröbner bases, or related structures, associated to linear codes. This Gröbner bases setting turns out to be strongly related to the combinatorics of the codes.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abbott, J., Kreuzer, M., Robiano, L.: Computing Zero-Dimensional Schemes. J. Symb. Comp. 39(1), 31–49 (2005)

    Article  MATH  Google Scholar 

  2. Adams, W.W., Loustaunau, P.: An introduction to Gröbner bases. Graduate Studies in Mathematics, 3. American Mathematical Society, Providence (1994)

    Google Scholar 

  3. Alonso, M.E., Marinari, M.G., Mora, T.: The Big Mother of all Dualities: Möller Algorithm. Comm. Algebra 31(2), 783–818 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Borges-Trenard, M.A., Borges-Quintana, M., Mora, T.: Computing Gröbner bases by FGLM techniques in a non-commutative setting. J. Symb. Comp. 30(4), 429–449 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Borges-Quintana, M., Borges-Trenard, M., Martínez-Moro, E.: On a Gröbner bases structure associated to linear codes. Submitted to J. Discrete Math. Sci. Cryptogr. (Arxiv Preprint), http://arxiv.org/abs/math.AC/0506045

  6. Borges-Quintana, M., Borges-Trenard, M., Fitzpatrick, P., Martínez-Moro, E.: Gröbner bases and combinatorics for binary codes. Submitted to Appl. Algebra Engrg. Comm. Comput. (2005)

    Google Scholar 

  7. Borges-Quintana, M., Winkler, F., Borges-Trenard, M.: FGLM Techniques Applied to Linear Codes – An Algorithm for Decoding Linear Codes. Techn. Rep., RISC-Linz, RISC - 00-14, J. Kepler Univ., Linz, Austria (2000)

    Google Scholar 

  8. Buchberger, B.: An Algorithmic Criterion for the Solvability of a System of Algebraic Equations (German). Aequationes Mathematicae 4, 374–383 (1970); English translation in [10]

    Article  MATH  MathSciNet  Google Scholar 

  9. Buchberger, B., Möller, H.M.: The construction of Multivariate Polynomials with Preassigned Zeros. In: Calmet, J. (ed.) ISSAC 1982 and EUROCAM 1982. LNCS, vol. 144, pp. 24–31. Springer, Heidelberg (1982)

    Google Scholar 

  10. Buchberger, B., Winkler, F. (eds.): Gröbner Bases and Applications. In: Proc. of the Conference 33 Years of Gröbner Bases. London Mathematical Society Lecture Notes Series 251, C.U.P. (1998)

    Google Scholar 

  11. Faugère, J., Gianni, P., Lazard, D., Mora, T.: Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering. J. Symb. Comp. 16(4), 329–344 (1993)

    Article  MATH  Google Scholar 

  12. Marinari, M.G., Möller, H.M., Mora, T.: Gröbner Bases of Ideals Defined by Functionals with an Application to Ideals of Projective Points. Appl. Algebra Engrg. Comm. Comput. 4(2), 103–145 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  13. Mora, T.: Solving Polynomial Equation Systems II: Macaulay’s Paradigm and Gröbner Technology. Encyclopedia of Maths. and its Applications 99. C.U.P. (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpto. de Matemática, FCMC, U. de Oriente, Santiago de Cuba, Cuba

    M. Borges-Quintana & M. A. Borges-Trenard

  2. Dpto. de Matemática Aplicada, U. de Valladolid, Spain

    E. Martínez-Moro

Authors
  1. M. Borges-Quintana
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. A. Borges-Trenard
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. Martínez-Moro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, University of Hawaii, Honolulu, USA

    Marc P. C. Fossorier

  2. National Institute of Advanced Industrial Science and Technology (AIST), Research Center for Information Security (RCIS),  

    Hideki Imai

  3. Department of Electrical and Computer Engineering, University of California, CA 95616, Davis,  

    Shu Lin

  4. University Paul Sabatier, AAECC/IRIT, 118 route de Narbonne, 31300, Toulouse cedex, France

    Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Borges-Quintana, M., Borges-Trenard, M.A., Martínez-Moro, E. (2006). A General Framework for Applying FGLM Techniques to Linear Codes. In: Fossorier, M.P.C., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2006. Lecture Notes in Computer Science, vol 3857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11617983_7

Download citation

  • DOI: https://doi.org/10.1007/11617983_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31423-3

  • Online ISBN: 978-3-540-31424-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation