495 search results - page 46 / 99 » Capacity of Non-Malleable Codes |
80
Voted
STOC
2009
ACM
15 years 11 months ago
2009
ACM
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
The problem of coding for channels with time-varying state is studied. Two different models are considered: one in which the channel state cannot depend on the transmitted signal,...
105
click to vote
STOC
2006
ACM
15 years 11 months ago
2006
ACM
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
FTCIT
2007
14 years 10 months ago
2007
This survey reviews fundamental concepts of multi-user information theory. Starting with typical sequences, the survey builds up knowledge on random coding, binning, superposition...
TIT
2010
14 years 5 months ago
2010
We study two building-block models of interference-limited wireless networks, motivated by the problem of joint Peer-to-Peer and Wide Area Network design. In the first case, a sin...