Sciweavers

163 search results - page 15 / 33
» Concatenated codes can achieve list-decoding capacity
Sort
View
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 5 months ago
Sum-Capacity and the Unique Separability of the Parallel Gaussian MAC-Z-BC Network
—THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. It is known that the capacity of parallel (e.g., multi-carrier) Gaussian point-to-point, multiple access and broadcast channe...
Viveck R. Cadambe, Syed Ali Jafar
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 6 months ago
Capacity of Cooperative Fusion in the Presence of Byzantine Sensors
Abstract-- The problem of cooperative fusion in the presence of both Byzantine sensors and misinformed sensors is considered. An information theoretic formulation is used to charac...
Oliver Kosut, Lang Tong
ICC
2009
IEEE
142views Communications» more  ICC 2009»
14 years 1 months ago
A Generalized Two-Way Relay Channel with Private Information for the Relay
—In the conventional two-way relay channel, two sources exchange information with help from a relay. We introduce a generalized two-way relay channel where each source additional...
Chin Keong Ho, Kiran T. Gowda, Sumei Sun
CORR
2007
Springer
119views Education» more  CORR 2007»
13 years 6 months ago
Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo Codes
— It has been observed that particular rate-1/2 partially systematic parallel concatenated convolutional codes (PCCCs) can achieve a lower error floor than that of their rate-1/...
Ioannis Chatzigeorgiou, Miguel R. D. Rodrigues, Ia...
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 6 months ago
The price of certainty: "waterslide curves" and the gap to capacity
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
Anant Sahai, Pulkit Grover