370 search results - page 72 / 74 » tit 2008 |
TIT
2008
13 years 10 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
TIT
2008
13 years 10 months ago
2008
In modern communication systems, different users have different requirements for quality of service (QoS). In this work, QoS refers to the average codeword error probability experi...
TIT
2008
13 years 10 months ago
2008
We consider the problem of sequential decision making for random fields corrupted by noise. In this scenario, the decision maker observes a noisy version of the data, yet judged wi...
TIT
2008
13 years 10 months ago
2008
We study the task of transforming a hard function f, with which any small circuit disagrees on (1 - )/2 fraction of the input, into a harder function f , with which any small circ...
TIT
2008
13 years 10 months ago
2008
We consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes...