Open AccessPerformance of BCH codes with (1 + x ) s error detection
Author(s) -
Ambroze M.,
Tomlinson M.
Publication year - 2014
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2013.3425
Subject(s) - bch code , error detection and correction , byte , mathematics , retransmission , forward error correction , algorithm , polynomial code , decoding methods , computer science , discrete mathematics , linear code , block code , telecommunications , computer hardware , transmission (telecommunications)
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.