On Bounds for $E$-capacity of DMC

Details On Bounds for $E$-capacity of DMC On Bounds for $E$-capacity of DMC

2006-10-23

arxiv.org/abs/cs/0610130v1

Computer Science

Information Theory

Scientific paper

Random coding, expurgated and sphere packing bounds are derived by method of types and method of graph decomposition for $E$-capacity of discrete memoryless channel (DMC). Three decoding rules are considered, the random coding bound is attainable by each of the three rules, but the expurgated bound is achievable only by maximum-likelihood decoding. Sphere packing bound is obtained by very simple combinatorial reasonings of the method of types. The paper joins and reviews the results of previous hard achievable publications.

Affiliated with

Also associated with

No associations

Rating

On Bounds for $E$-capacity of DMC 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 Bounds for $E$-capacity of DMC, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Bounds for $E$-capacity of DMC will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-276945