Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Coding Theory and Applications

Coding Theory 1988: Coding Theory and Applications pp 232–243Cite as

Linear recurrence relations and an extended subresultant algorithm

  • Section III Combinatorial And Algebraic Aspects
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 388))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Camion, P., An Iterative Euclidean Algorithm. Proc. Conf. AAECC5, Menorca 1987, to appear in Lect.Notes in Computer Science Series, Springer-Verlag.

    Google Scholar 

  • Lidl, R., Niederreiter, H., Finite Fields, (Encyclopaedia of Mathematics and its Applications, Vol. 20) Addison-Wesley, Reading, Mass. (1987).

    Google Scholar 

  • Loos, R., Generalized Polynomial Remainder Sequences in Computer Algebra, Symbolic and Algebraic Computations (Buchberger, Collins and Loos (eds)) Springer Verlag, Berlin (1983) 115–137.

    Google Scholar 

  • Massey, J.L., Shift Register Sequences and BCH Decoding, IEEE Trans. IT-15 (1969) 122–127.

    Google Scholar 

  • McEliece, R.J., The Theory of Information and Coding (Encyclopaedia of Mathematics and its Applications, Vol. 3) Addison-Wesley, Reading, Mass. (1977).

    Google Scholar 

  • Samuel, P., Lectures on Unique Factorization Domains. (notes by P. Murthy), Tata Institute for Fundamental Research, Bombay (1964).

    Google Scholar 

  • Zariski, O., Samuel, P., Commutative Algebra, Vol II, van Nostrand, Princeton (1960).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University College, Cork, Ireland

    Patrick Fitzpatrick

  2. Laboratoire d'Analyse Numérique, Mathématiques, Université Paul Sabatier, 118, Route de Narbonne, 31062, Toulouse Cedex, France

    Graham Norton

Authors
  1. Patrick Fitzpatrick
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Graham Norton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Jacques Wolfmann

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fitzpatrick, P., Norton, G. (1989). Linear recurrence relations and an extended subresultant algorithm. In: Cohen, G., Wolfmann, J. (eds) Coding Theory and Applications. Coding Theory 1988. Lecture Notes in Computer Science, vol 388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019862

Download citation

  • DOI: https://doi.org/10.1007/BFb0019862

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51643-9

  • Online ISBN: 978-3-540-46726-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation