All Questions
2 questions
1
vote
1
answer
139
views
A polynomial recovery problem
Suppose we know $deg(m(x))=n-1=deg(f_1(x))=deg(f_2(x))$.
Suppose we know $C_1(x),C_2(x)$ where $deg(C_i)=n$.
Then given $n$ values of $$C_1(x)(x+1)m(x) +C_1(x)(x+2)f_1(x)\in\Bbb F_q[x]$$ and $n$ ...
1
vote
0
answers
81
views
On sparse $0/1$ linear equations solvable with compressed sensing
If you have a system of $m$ linearly independent equations in $n$ variables with domain $0/1$ and we know there is at least one solution with at most $d$ variables to be $1$ then if $m$ at least a ...