Loading...
conference paper
Fountain codes for piecewise stationary channels
2008
Proceedings of the IEEE International Symposium on Information Theory
In this paper, two fixed per-information symbol complexity lossless source coding algorithms are modified for estimation and incremental LT decoding over piecewise stationary memoryless channels (PSMC's) with a bounded number of abrupt changes in channel statistics. In particular, as a class of PSMC's, binary symmetric channels are considered with a crossover probability that changes a bounded number of times with no repetitions in the statistics. Simulation results are given which illustrate the benefits of using our algorithms, both in terms of probability of error and in terms of redundancy.
Type
conference paper
Web of Science ID
WOS:000260364401172
Authors
Publication date
2008
Publisher
Published in
Proceedings of the IEEE International Symposium on Information Theory
Publisher place
Toronto
Start page
2242
End page
2246
Peer reviewed
REVIEWED
EPFL units
Event name | Event place | Event date |
Toronto | July 2008 | |
Available on Infoscience
September 30, 2008
Use this identifier to reference this record