Abstract. We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
—Packet based wireless networks have provided high data rates, and the desire for ubiquitous wireless computing is growing rapidly. To accommodate these demands, wireless systems...
In this paper we introduce the notion of a Public-Key Encryption Scheme that is also a Locally-Decodable Error-Correcting Code (PKLDC). In particular, we allow any polynomialtime ...
Abstract--Designing diversity achieving schemes over the wireless broadband fading relay channels is crucial to achieve higher diversity gains. These gains are achieved by exploiti...