Citation
Abstract
In this article, a lower bound for the decoder error probability PE(u) of a linear maximum distance separable (MDS) code is derived by counting the dominant types of decoding words around code words. It is shown that the lower bound derived in this article is similar in form, and close numerically, to the upper bound derived in [2].
Details
- Volume
- 42-92
- Published
- February 15, 1988
- Pages
- 43–49
- File Size
- 313.5 KB