Fountain codes based partial cooperation in cooperative communications
Abstract
References
Index Terms
- Fountain codes based partial cooperation in cooperative communications
Recommendations
Block-Markov encoding with network coding for cooperative communications
In this paper, we propose network coding as an operational implementation of information theoretic block-Markov coding for cooperative communications. This is a transmission strategy where users act as a relay for each other to help reliable recovery of ...
Trapping sets of fountain codes
The remarkable results of Fountain codes over the binary erasure channel (BEC) have motivated research on their practical implementation over noisy channels. Trapping sets are a phenomenon of great practical importance for certain graph codes on noisy ...
Fountain codes over fading relay channels
This paper discusses cooperative protocols based on fountain codes in a relay network. Unlike traditional fixed-rate codes, fountain codes are capable of adapting the bit rate to the channel realization blindly, i.e., without channel information at the ...
Comments
Information & Contributors
Information
Published In

- General Chairs:
- Ahmed Helmy,
- Peter Mueller,
- Program Chair:
- Yan Zhang
Sponsors
- Computer and Information Society
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 182Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in