Sciweavers

495 search results - page 3 / 99
» Capacity of Non-Malleable Codes
Sort
View
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 3 months ago
Least Squares Superposition Codes of Moderate Dictionary Size, Reliable at Rates up to Capacity
Sparse superposition codes are developed for the additive white Gaussian noise channel with average codeword power constraint. Codewords are linear combinations of subsets of vecto...
Andrew R. Barron, Antony Joseph
TCOM
2010
107views more  TCOM 2010»
13 years 4 months ago
Near-Capacity Cooperative Space-Time Coding Employing Irregular Design and Successive Relaying
— In this paper, we develop a capacity-approaching Cooperative Space-Time Coding (CSTC) scheme employing irregular design for a twin-relay aided network as an extension of our pr...
Lingkun Kong, Soon Xin Ng, Robert G. Maunder, Lajo...
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 3 months ago
Approximately achieving Gaussian relay network capacity with lattice codes
Abstract--Recently, it has been shown that a quantize-mapand-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitr...
Ayfer Özgür, Suhas N. Diggavi
TIT
1998
108views more  TIT 1998»
13 years 5 months ago
The Capacities of Frequency-Hopped Code-Division Multiple-Access Channels
Abstract— This correspondence investigates and compares the capacities of two types of frequency-hopped code-division multiple-access (FH-CDMA) communications systems; namely, mu...
Jin G. Goh, Svetislav V. Maric