194 search results - page 10 / 39 » Better polynomials for GNFS |
TIT
2008
13 years 9 months ago
2008
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
ISSAC
1997
Springer
14 years 1 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
GLOBECOM
2009
IEEE
14 years 1 months ago
2009
IEEE
Many existing pairwise key establishment in sensor networks were developed based on the polynomial-based method. However, this method cannot offer the basic authentication function...
DSN
2006
IEEE
14 years 1 months ago
2006
IEEE
Cyclic redundancy codes (CRCs) are widely used in network transmission and data storage applications because they provide better error detection than lighter weight checksum techn...