Sciweavers

12 search results - page 3 / 3
» Distribution of irreducible polynomials of small degrees ove...
Sort
View
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
13 years 9 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
STOC
2009
ACM
161views Algorithms» more  STOC 2009»
14 years 6 months ago
List decoding tensor products and interleaved codes
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...
Parikshit Gopalan, Venkatesan Guruswami, Prasad Ra...