Computer Science – Information Theory
Scientific paper
2006-07-02
Computer Science
Information Theory
Submitted to the IEEE Trans. on Information Theory (as a correspondence), March 2006. Revised (August 2006)
Scientific paper
The performance of maximum-likelihood (ML) decoded binary linear block codes over the AWGN channel is addressed via the tangential-sphere bound (TSB) and two of its recent improved versions. The paper is focused on the derivation of the error exponents of these bounds. Although it was exemplified that some recent improvements of the TSB tighten this bound for finite-length codes, it is demonstrated in this paper that their error exponents coincide. For an arbitrary ensemble of binary linear block codes, the common value of these error exponents is explicitly expressed in terms of the asymptotic growth rate of the average distance spectrum.
Sason Igal
Twitto M.
No associations
LandOfFree
On the Error Exponents of Some Improved Tangential-Sphere Bounds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Error Exponents of Some Improved Tangential-Sphere Bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Error Exponents of Some Improved Tangential-Sphere Bounds will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-451185