495 search results - page 15 / 99 » Capacity of Non-Malleable Codes |
TIT
1998
13 years 8 months ago
1998
Abstract—A class of capacity-achieving, low-complexity, highreliability, variable-rate coding schemes is developed for communication over discrete memoryless channels with noisel...
GLOBECOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— The paper extends the pragmatic approach to coded continuous-phase modulation (CPM). It first proposes an optimization of the CPM capacity for given complexity and bandwidth e...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The min-cut value towards a single receiver in a network with unit capacity edges can be achieved by routing a single bit. The multicast theorem in network coding shows that, the c...
CGO
2005
IEEE
14 years 2 months ago
2005
IEEE
Software code caches are becoming ubiquitous, in dynamic optimizers, runtime tool platforms, dynamic translators, fast simulators and emulators, and dynamic compilers. Caching fre...