_fmpz_mod_poly_minpoly_bm, fmpz_mod_poly_minpoly_bm
Synopsis
#include <flint/fmpz_mod_poly.h>slong _fmpz_mod_poly_minpoly_bm(fmpz * poly, const fmpz * seq, slong len, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_minpoly_bm(fmpz_mod_poly_t poly, const fmpz * seq, slong len, const fmpz_mod_ctx_t ctx)sourceLike fmpz_mod_poly_minpoly, using the Berlekamp–Massey algorithm [Ber1968] [Mas1969], in O(\mathit{len} \cdot d) operations for a minimal polynomial of degree d.
References#
- [Ber1968] E. R. Berlekamp. Algebraic Coding Theory. McGraw-Hill, 1968.
- [Mas1969] J. L. Massey. Shift-register synthesis and BCH decoding. IEEE Transactions on Information Theory 15 (1969), 122–127.
Cite this page
The FLINT team, “_fmpz_mod_poly_minpoly_bm, fmpz_mod_poly_minpoly_bm (fmpz_mod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_minpoly_bm.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-minpoly-bm,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_minpoly\_bm, fmpz\_mod\_poly\_minpoly\_bm (fmpz\_mod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_minpoly_bm.html},
note = {Generated 2026-10-20}
}