3852 search results - page 675 / 771 » Construction of Codes for Network Coding |
165
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
160
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
159
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
162
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
201
click to vote
OOPSLA
2007
Springer
15 years 11 months ago
2007
Springer
Developing a general component system for a statically typed, object-oriented language is a challenging design problem for two reasons. First, mutually recursive references across...