Sciweavers

56 search results - page 8 / 12
» Upper bounds on the rate of LDPC Codes
Sort
View
TCOM
2010
114views more  TCOM 2010»
13 years 5 months ago
Achieving near-capacity performance on multiple-antenna channels with a simple concatenation scheme
This paper proposes a capacity-approaching, yet simple scheme for multi-input multiple-output (MIMO) channels. The proposed scheme is based on a concatenation of a mixture of short...
Nghi H. Tran, Tho Le-Ngoc, Tad Matsumoto, Ha H. Ng...
TIT
2008
72views more  TIT 2008»
13 years 10 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski
INFOCOM
2002
IEEE
14 years 3 months ago
On the capacity of wireless networks: The relay case
Abstract— In [1], Gupta and Kumar determined the capacity of wireless networks under certain assumptions, among them point-to-point coding, which excludes for example multi-acces...
Michael Gastpar, Martin Vetterli
ICC
2008
IEEE
120views Communications» more  ICC 2008»
14 years 5 months ago
Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks
Abstract— Single-Symbol Maximum Likelihood (ML) decodable Distributed Orthogonal Space-Time Block Codes (DOSTBCs) have been introduced recently for cooperative networks and an up...
Jagadeesh Harshan, B. Sundar Rajan
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 8 months ago
Coding for High-Density Recording on a 1-D Granular Magnetic Medium
In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent ...
Arya Mazumdar, Alexander Barg, Navin Kashyap