Sciweavers

495 search results - page 19 / 99
» Capacity of Non-Malleable Codes
Sort
View
NIPS
2004
13 years 10 months ago
Sparse Coding of Natural Images Using an Overcomplete Set of Limited Capacity Units
It has been suggested that the primary goal of the sensory system is to represent input in such a way as to reduce the high degree of redundancy. Given a noisy neural representati...
Eizaburo Doi, Michael S. Lewicki
CORR
2006
Springer
70views Education» more  CORR 2006»
13 years 9 months ago
Channel Coding: The Road to Channel Capacity
Daniel J. Costello Jr., G. David Forney Jr.
TIT
2010
136views Education» more  TIT 2010»
13 years 3 months ago
The existence of concatenated codes list-decodable up to the hamming bound
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
ICC
2009
IEEE
124views Communications» more  ICC 2009»
14 years 3 months ago
Power Optimal Signaling for Fading Multi-Access Channel in Presence of Coding Gap
—In a multi-access fading channel, dynamic allocation of bandwidth, transmission power and rates is an important aspect to counter the detrimental effect of time-varying nature o...
Ankit Sethi, Prasanna Chaporkar, Abhay Karandikar
ISSS
1999
IEEE
85views Hardware» more  ISSS 1999»
14 years 1 months ago
Efficient Scheduling of DSP Code on Processors with Distributed Register Files
Code generation methods for digital signal processors are increasingly hampered by the combination of tight timing constraints imposed by the algorithms and the limited capacity o...
Bart Mesman, Carlos A. Alba Pinto, Koen Van Eijk