Skip to main content
SpringerLink
Log in
Book cover

International Conference on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes

AAECC 1985: Algebraic Algorithms and Error-Correcting Codes pp 363–372Cite as

Extending the binary GCD algorithm

  • Conference paper
  • First Online:

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

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.

Bibliography

  1. Alagic, S., Arbib, M., “The Design of Well-Structured and Correct Programs”, Springer-Verlag, New York, Heidelberg, Berlin, (1978).

    Google Scholar 

  2. Knuth, D., “The Art of Computer Programming”, Vol. 2 (Second Edition), Addison Wesley, Reading, Massachusetts, 1981

    Google Scholar 

  3. Lueneberg, H., Private Communication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IT Research Centre, University of Bristol, BS8 1TR, Bristol, UK

    G. H. Norton

Authors
  1. G. H. Norton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jacques Calmet

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Norton, G.H. (1986). Extending the binary GCD algorithm. In: Calmet, J. (eds) Algebraic Algorithms and Error-Correcting Codes. AAECC 1985. Lecture Notes in Computer Science, vol 229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16776-5_741

Download citation

  • DOI: https://doi.org/10.1007/3-540-16776-5_741

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16776-1

  • Online ISBN: 978-3-540-39855-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation