Skip to main content
Log in

Subspaces and polynomial factorizations over finite fields

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

Recently Niederreiter described a new method for factoring polynomials over finite fields. As with the Berlekamp technique, the method requires the construction of a linear subspace whose dimension is precisely the number of irreducible factors of the polynomial being considered. This paper explores the connection between these subspaces and gives a characterization of other subspaces having properties which are similar.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Berlekamp, E. R.: Factoring polynomials over finite fields. Bell System Technical J.46, 1853–1859 (1967)

    Google Scholar 

  2. Miller, V.: Berlekamp versus Niederreiter, preprint

  3. Niederreiter, H.: A New Efficient Factorization Algorithm for Polynomials over Small Finite Fields. AAECC4, 81–87 (1993)

    Google Scholar 

  4. Niederreiter, H.: Factorization of polynomials and some linear algebra problems over finite fields. Linear Algebra Appl. (to appear)

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, T.C.Y., Vanstone, S.A. Subspaces and polynomial factorizations over finite fields. AAECC 6, 147–157 (1995). https://doi.org/10.1007/BF01195333

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation