37 search results - page 8 / 8 » On the Degree of Univariate Polynomials Over the Integers |
STOC
2009
ACM
14 years 11 months ago
2009
ACM
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
JC
2007
13 years 10 months ago
2007
Let q ≥ 1 be an integer, Sq denote the unit sphere embedded in the Euclidean space Rq+1, and µq be its Lebesgue surface measure. We establish upper and lower bounds for sup fâˆ...