Name
Title | ||
|---|---|---|
An application of a wringing lemma to the multiple access channel with cooperative encoders |
Abstract | ||
|---|---|---|
The problem of communicating over a multiple access channel with cooperative encoders is studied. A new upper bound is derived on the capacity which is motivated by the regime of operation where the relays start to cooperate. The proof technique is based on a wringing lemma by Dueck and Ahlswede which was used for the multiple description problem with no excess rate. Previous upper bounds are shown to be loose in general, and may be improved. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/IWCIT.2014.6842504 | IWCIT |
Keywords | Field | DocType |
codecs,cooperative communication,multi-access systems,cooperative encoders,multiple access channel,multiple description problem,wringing lemma,adders,upper bound,artificial neural networks,random variables | Upper and lower bounds,Communication channel,Theoretical computer science,Encoder,Multiple description,Lemma (mathematics),Mathematics | Conference |
ISSN | Citations | PageRank |
2374-3212 | 0 | 0.34 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bidokhti, S.S. | 1 | 81 | 4.26 |
| Gerhard Kramer | 2 | 445 | 34.21 |