We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
Automatic pronunciation of words from their spelling alone is a hard computational problem, especially for languages like English and French where there is only a partially consis...
Wireless amplify-and-forward relay networks in which the source communicates with the relays and destination in the first phase and the relays forward signals to the destination in...
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
In analyzing the point-to-point wireless channel, insights about two qualitatively different operating regimes-bandwidth- and power-limited--have proven indispensable in the design...