Documentation

CompPoly.Bivariate.GuruswamiSudan.Root.Common

Common Guruswami-Sudan Root Helpers #

Executable helpers shared by bounded bivariate root backends.

The coefficient of Y^j in Q(0, Y), as a polynomial in the next root coefficient.

Instances For

    Executable final check for the GS root condition.

    Instances For

      Filter a candidate family to exact bounded-degree roots.

      Instances For
        def CompPoly.GuruswamiSudan.extendPrefix {F : Type u_1} [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] (pref : CPolynomial F) (depth : ) (coeff : F) :

        Extend one candidate prefix by one coefficient at X^depth.

        Instances For

          Truncate a polynomial to its first n coefficients.

          Instances For

            Query a field-root backend only for nonzero equations.

            A zero equation imposes no restriction on the next coefficient. Enumerating all field elements is unsuitable for large fields, so bounded-root backends use residual normalization to avoid zero equations for nonzero bivariate inputs.

            Instances For