15 search results - page 3 / 3 » Codes as Modules over Skew Polynomial Rings |
TCC
2009
Springer
14 years 6 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
COMPGEOM
2004
ACM
13 years 11 months ago
2004
ACM
We show that the persistent homology of a filtered ddimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analy...
BIRTHDAY
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. Digital numbers D are the world’s most popular data representation: nearly all texts, sounds and images are coded somewhere in time and space by binary sequences. The m...
ICC
2007
IEEE
14 years 3 days ago
2007
IEEE
In this paper, we propose a utility-based resource allocation scheme for layer-encoded IPTV multicast streaming service over IEEE 802.16 WiMAX networks. Unlike existing utility-bas...