Download now Free registration required
One of the main problems in transmitting coded data is that the decoder does not know the real number of errors to correct. This issue is critical since it means that the decoders spend much more iterations for correcting them. A paradigm case of this is the Bose-Chaudhuri-Hocquenghem (BCH) code. This type of code generally resorts to the Berlekamp-Massey algorithm to estimate the Error Locator Polynomial (ELP) in an iterative manner. The number of iterations of this algorithm is fixed by the maximum error capability of the BCH code. This constraint is a drawback when the real number of errors in the codeword is small and the maximum error capability is high.
- Format: PDF
- Size: 198.61 KB