On design of rateless codes over dying binary erasure channel

Published

Journal Article

In this paper, we study a practical coding scheme for the dying binary erasure channel (DBEC), which is a binary erasure channel (BEC) subject to a random fatal failure. We consider the rateless codes and optimize the degree distribution to maximize the average recovery probability. In particular, we first study the upper bound of the average recovery probability, based on which we define the objective function as the gap between the upper bound and the average recovery probability achieved by a particular degree distribution. We then seek the optimal degree distribution by minimizing the objective function. A simple and heuristic approach is also proposed to provide a suboptimal but good degree distribution. Simulation results are presented to show the significant performance gain over the conventional LT codes. © 2012 IEEE.

Full Text

Duke Authors

Cited Authors

  • Zeng, M; Calderbank, R; Cui, S

Published Date

  • April 1, 2012

Published In

Volume / Issue

  • 60 / 4

Start / End Page

  • 889 - 894

International Standard Serial Number (ISSN)

  • 0090-6778

Digital Object Identifier (DOI)

  • 10.1109/TCOMM.2012.022712.110038

Citation Source

  • Scopus