Documentation

CompPoly.Bivariate.GuruswamiSudan.Filter

Guruswami-Sudan Candidate Filtering #

Generic packed-point filtering for algebraic gsCore outputs.

source
def CompPoly.GuruswamiSudan.candidateMismatchCount {F : Type u_1} [Semiring F] [BEq F] (points : Array (F × F)) (p : CPolynomial F) :
ℕ

Number of packed points where p(x) differs from the supplied y.

Instances For
    source
    def CompPoly.GuruswamiSudan.matchingPointCount {F : Type u_1} [Semiring F] [BEq F] (points : Array (F × F)) (p : CPolynomial F) :
    ℕ

    Number of packed points where p(x) matches the supplied y.

    Instances For
      source
      def CompPoly.GuruswamiSudan.passesCandidateDistance {F : Type u_1} [Semiring F] [BEq F] (points : Array (F × F)) (radius : ℕ) (p : CPolynomial F) :
      Bool

      Boolean distance predicate for packed candidate filtering.

      Instances For
        source
        def CompPoly.GuruswamiSudan.gsFilteredCore {F : Type u_1} [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] (points : Array (F × F)) (interpContext : GSInterpContext F) (rootContext : GSRootContext F) (params : GSInterpParams) (radius : ℕ) :
        Array (CPolynomial F)

        Run the algebraic GS core and keep only candidates within the packed mismatch radius.

        Instances For