Abstract

In this paper, we consider a binary erasure channel (BEC) with an unknown erasure probability of ${\delta }$ at a transmitter. In addition, we consider that ${\delta }$ has a constant value in each transmission block and the transmitter knows the probability distribution of ${\delta }$ . For this problem with the infinite block length, based on the distribution of the random variable ${\delta }$ , a multi-layer encoding strategy at the transmitter and a successive decoding strategy at the receiver are proposed. In our proposed scheme, based on the value of ${\delta }$ , the receiver can decode a part of transmitted data from different transmission layers. In order to have a comparison with other erasure correction codes, we generalize the result of the infinite block length to the finite block-length transmission. We show that considering the average transmission rate, our scheme has a better performance than the other erasure correction codes such as the Raptor and the MDS codes. We also analyze both the decoding complexity and bit error rate versus the erasure probability of the channel. Besides, by using a numerical comparison, we try to show that our proposed strategy outperforms other transmission strategies.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.