Sciweavers

48 search results - page 2 / 10
» Edge-Cut Bounds on Network Coding Rates
Sort
View
CORR
2007
Springer
99views Education» more  CORR 2007»
14 years 11 months ago
High Rate Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks
—Distributed orthogonal space–time block codes (DOSTBCs) achieving full-diversity order and single-symbol maximum-likelihood (ML) decodability have been introduced recently by ...
Jagadeesh Harshan, B. Sundar Rajan
99
Voted
DFG
2009
Springer
15 years 6 months ago
Interactive Communication, Diagnosis and Error Control in Networks
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
Rudolf Ahlswede, Harout K. Aydinian
100
Voted
INFOCOM
2002
IEEE
15 years 4 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
104
Voted
TIT
2010
112views Education» more  TIT 2010»
14 years 6 months ago
Asymmetric multilevel diversity coding and asymmetric Gaussian multiple descriptions
We consider the asymmetric multilevel diversity (A-MLD) coding problem, where a set of 2 K 1 information sources, ordered in a decreasing level of importance, is encoded into K me...
Soheil Mohajer, Chao Tian, Suhas N. Diggavi
105
Voted
MOBIHOC
2012
ACM
13 years 2 months ago
Throughput of rateless codes over broadcast erasure channels
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
Yang Yang, Ness B. Shroff