1 research outputs found
Noisy polynomial interpolation modulo prime powers
We consider the {\it noisy polynomial interpolation problem\/} of recovering
an unknown -sparse polynomial over the ring of
residues modulo , where is a small prime and is a large integer
parameter, from approximate values of the residues of . Similar results are known for residues modulo a large prime ,
however the case of prime power modulus , with small and large , is
new and requires different techniques. We give a deterministic polynomial time
algorithm, which for almost given more than a half bits of for
sufficiently many randomly chosen points , recovers