Abstract
The performance is investigated of a combined error correction and detection decoder for BCH codes for which the generator polynomial g ( x ) has been augmented by a (1 + x ) s term in order to make the informations bits an integral number of bytes. An ARQ retransmission scheme on an additive white Gaussian noise channel is assumed and a comparison with an FEC-only BCH code is given in terms of probability of error against E b / N 0 . It is shown for a BCH (127, 106, 7) code that at high E b / N 0 the performance improvement is of three orders of magnitude at the cost of a small rate degradation. Goppa codes, whose length is an integral number of bytes, have also been investigated, producing similar results.
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.
