Abstract
In this paper, it is shown that the bit erasure probability of turbo codes with iterative decoding in the waterfall region is nonlinearly scaled by the information blocklength. This result can be used to predict efficiently the bit erasure probability of the finite-length turbo codes over the binary erasure channel.
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 callDisclaimer: 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.
