Skip to main content
SpringerLink
Log in

On a little but useful algorithm

  • Conference paper
  • First Online:
Algebraic Algorithms and Error-Correcting Codes (AAECC 1985)

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 to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. O. Helmer, The Elementary Divisor Theorem for Certain Rings without Chain Conditions. Bull. Amer. Math. Soc. 49, 225–236 (1943)

    Google Scholar 

  2. I. Kaplansky, Elementary Divisors and Modules. Trans. Amer. Math. Soc. 66, 464–491 (1949)

    Google Scholar 

  3. H. Lüneburg, On the Rational Normal Form of Endomorphisms. A Primer to Constructive Algebra. Bibliographisches Institut, Mannheim. Forthcoming.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Mathematik der Universität, Pfaffenbergstraße 95, D-6750, Kaiserslautern

    Heinz Lüneburg

Authors
  1. Heinz Lüneburg
    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

Lüneburg, H. (1986). On a little but useful 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_732

Download citation

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

  • 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