Verification-Based Decoding for Rateless Codes in the Presence of Errors and Erasures

Authors

  • Usana Tuntoolavesta Kasetsart University
  • Nabeela Shaheen Kasetsart University
  • Visuttha Manthamkarn Kasetsart University

DOI:

https://doi.org/10.4186/ej.2022.26.4.37

Keywords:

verification-based decoding, multicast, erroneous packets, lost packets, Rateless code

Abstract

In this paper, verification-based decoding is proposed for the correction and filling-in of lost/erased packets for multicast service in data networks, which employs Rateless codes. Patterns of preferred parity-check equations are presented for the reduction of the average number of parity-check symbols required. Since the locations of unverified symbols are known, the effect of erasures and errors is the same in terms of the overhead required for successful decoding. Simulation results show that for an error-only, an erasure-only or a combination of both at 10% error/erasure probability, 78% of the messages can be recovered with a 50% overhead, whereas 99% of the messages can be recovered with a 100% overhead.

Downloads

Download data is not yet available.

Author Biographies

Usana Tuntoolavesta

Department of Electrical Engineering, Faculty of Engineering, Kasetsart University, Bangkok, 10900, Thailand

Nabeela Shaheen

Department of Electrical Engineering, Faculty of Engineering, Kasetsart University, Bangkok, 10900, Thailand

Visuttha Manthamkarn

Department of Electrical Engineering, Faculty of Engineering, Kasetsart University, Bangkok, 10900, Thailand

Downloads

Published In
Vol 26 No 4, Apr 30, 2022
How to Cite
[1]
U. Tuntoolavesta, N. Shaheen, and V. Manthamkarn, “Verification-Based Decoding for Rateless Codes in the Presence of Errors and Erasures”, Eng. J., vol. 26, no. 4, pp. 37-44, Apr. 2022.