495 search results - page 8 / 99 » Capacity of Non-Malleable Codes |
110
click to vote
TIT
2011
14 years 8 months ago
2011
In this paper, we consider the Gaussian multiple-input multiple-output (MIMO) multi-receiver wiretap channel in which a transmitter wants to have confidential communication with ...
129
click to vote
CORR
2010
Springer
15 years 11 days ago
2010
Springer
— We demonstrate a decoding scheme for nested lattice codes which is able to decode a list of a particular size which contains the transmitted codeword with high probability. Thi...
141
click to vote
TIT
2010
14 years 8 months ago
2010
We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar...
175
click to vote
ACCESSNETS
2009
Springer
14 years 11 months ago
2009
Springer
This paper investigates the capacity of a wireless two-way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-th...
137
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Shannon defined channel capacity as the highest rate at which there exists a sequence of codes of block length n such that the error probability goes to zero as n goes to infinity....