322 search results - page 22 / 65 » Satisfiability Coding Lemma |
CCS
2008
ACM
13 years 9 months ago
2008
ACM
While many obfuscation schemes proposed, none of them satisfy any strong definition of obfuscation. Furthermore secure generalpurpose obfuscation algorithms have been proven to be...
DSN
2002
IEEE
14 years 15 days ago
2002
IEEE
Standardized 32-bit Cyclic Redundancy Codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) of only 4 for maximum-length Ethern...
SAS
1999
Springer
13 years 11 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This paper investigates the problem of secure lossy source coding in the presence of an eavesdropper with arbitrary correlated side informations at the legitimate decoder (referre...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
Network coding has been shown to be capable of greatly improving quality of service in P2P live streaming systems (e.g., IPTV). However, network coding is vulnerable to pollution a...