Guruswami-Sudan Core #
End-to-end executable CompPoly Guruswami-Sudan polynomial core, following the interpolation-and-root-finding decomposition of [GS99].
References #
- [Guruswami, V., and Sudan, M., Improved decoding of Reed-Solomon and algebraic-geometry codes][GS99]
def
CompPoly.GuruswamiSudan.gsCore
{F : Type u_1}
[Field F]
[BEq F]
[LawfulBEq F]
[DecidableEq F]
(points : Array (F × F))
(interpContext : GSInterpContext F)
(rootContext : GSRootContext F)
(params : GSInterpParams)
:
Array (CPolynomial F)
Run interpolation, then bounded-degree root finding, using explicit backends.