Error Rates of Capacity-Achieving Codes Are Convex

Details Error Rates of Capacity-Achieving Codes Are Convex Error Rates of Capacity-Achieving Codes Are Convex

2010-04-15

arxiv.org/abs/1004.2683v1

Computer Science

Information Theory

accepted by ISIT-10

Scientific paper

Motivated by a wide-spread use of convex optimization techniques, convexity properties of bit error rate of the maximum likelihood detector operating in the AWGN channel are studied for arbitrary constellations and bit mappings, which also includes coding under maximum-likelihood decoding. Under this generic setting, the pairwise probability of error and bit error rate are shown to be convex functions of the SNR and noise power in the high SNR/low noise regime with explicitly-determined boundary. Any code, including capacity-achieving ones, whose decision regions include the hardened noise spheres (from the noise sphere hardening argument in the channel coding theorem) satisfies this high SNR requirement and thus has convex error rates in both SNR and noise power. We conjecture that all capacity-achieving codes have convex error rates.

Affiliated with

Also associated with

No associations

Rating

Error Rates of Capacity-Achieving Codes Are Convex 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 Error Rates of Capacity-Achieving Codes Are Convex, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Error Rates of Capacity-Achieving Codes Are Convex will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-380547