Skip to main content
Log in

The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain

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

Abstract

We present an extended polynomial remainder sequence algorithm XPRS for R[X] whereR is a domain. From this we derive a Berlekamp-Massey algorithm BM/R overR. We show that if (α) is a linear recurring sequence in a factorial domainU, then the characteristic polynomials for (α) form aprincipal ideal which is generated by a primitive minimal polynomial. Moreover, this generator ismonic when U[[X]] is factorial (for example, whenU is Z orK[X 1,X2,...,Xn] whereK is a field). From XPRS we derive an algorithm MINPOL for determining the minimal polynomial of (α) when an upper bound on the degree of some characteristic polynomial and sufficiently many initial terms of (α) are known. We also show how to obtain a Berlekamp-Massey type minimal polynomial algorithm from BM/U and state BM_MINPOL/K explicitly with a further refinement. Examples are given forU=Z, GF(2)[Y].

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Beker, H., Piper, F.: Cipher Systems. London: Northwood Books 1982

    Google Scholar 

  2. Berlekamp, E. R.: Algebraic Coding Theory. New York: McGraw-Hill 1968

    Google Scholar 

  3. Bourbaki, N.: Elements of Mathematics, Vol. 7, Commutative Algebra (Chapter 7). Paris: Hermann 1972

    Google Scholar 

  4. Collins, G. E.: Subresultants and reduced polynomial remainder sequences. JACM14, 128–142 (1967)

    Google Scholar 

  5. Cerlienco, L., Mignotte, M., Piras, F.: Suites récurrentes linéares. L'Enseign. Math.33, 67–108 (1987)

    Google Scholar 

  6. Dornstetter, J.-L.: On the equivalence between Berlekamp's and Euclid's algorithms. IEEE Trans, on Info. Th.IT-33, 428–431 (1987)

    Google Scholar 

  7. Fitzpatrick, P., Norton, G. H.: Linear recurrence relations and an extended subresultant algorithm. In: Cohen, G., Wolfmann, J. (eds.) Third Int. Coll. on Coding Theory and Applications (pp. 232–243). Lecture Notes in Computer Science, Vol. 388. Berlin, Heidelberg, New York: Springer 1989

    Google Scholar 

  8. Fitzpatrick, P., Norton, G. H.: Finding the characteristic ideal of ann-dimensional linear recurring sequence. IEEE Trans. on Info. Th.IT-36, 1480–1487 (1990)

    Google Scholar 

  9. Fitzpatrick, P., Norton, G. H.: Linear recurring sequences and the path weight enumerator of a convolutional code. Elect. Lett.27, 98–99 (1991)

    Google Scholar 

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

    Google Scholar 

  11. Loos, R.: Generalized polynomial remainder sequences. In: Buchberger, B., Collins, G. E., and Loos, R. (eds.), Computer Algebra, Symbolic and Algebraic Computations (pp. 115–137). Berlin, Heidelberg, New York: Springer Verlag 1983

    Google Scholar 

  12. Massey, J. L.: Shift register synthesis and BCH decoding. IEEE Trans. on Info. Th.IT-15, 122–127 (1969)

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fitzpatrick, P., Norton, G.H. The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain. AAECC 6, 309–323 (1995). https://doi.org/10.1007/BF01235722

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation