Low-density random linear fountain (LDRLF) codes are a type of LT (Luby transform) codes with optimum erasure correction under maximum likelihood (ML) decoding given a certain density or average check node degree. The upper bound on the residual symbol erasure rate is very tight and can be used for the design of LDRLF codes instead of performing time-consuming simulations. Using LDRLF codes for unequal error protection (UEP), the excellent erasure correction performance is maintained as well as the tightness of the upper bounds for each importance class. Since the UEP upper bounds may be complex to compute, we provide an extremely good approximation thereof which is well suited to design UEP LDRLF codes. Furthermore, we provide a heuristic criterion that has to be fulfilled in order to yield good approximations.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
The following notice applies to all IEEE publications:
© IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.