Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#236002] of Robert Calderbank

Papers Published

  1. Zeng, M; Calderbank, R; Cui, S, On design of rateless codes over dying binary erasure channel, Ieee Transactions on Communications, vol. 60 no. 4 (2012), pp. 889-894, ISSN 0090-6778 [doi]
    (last updated on 2018/11/19)

    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.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320