Simple Channel Coding Bounds

Details Simple Channel Coding Bounds Simple Channel Coding Bounds

2009-01-07

arxiv.org/abs/0901.0834v3

Computer Science

Information Theory

Presented at ISIT 2009

Scientific paper

New channel coding converse and achievability bounds are derived for a single use of an arbitrary channel. Both bounds are expressed using a quantity called the "smooth 0-divergence", which is a generalization of Renyi's divergence of order 0. The bounds are also studied in the limit of large block-lengths. In particular, they combine to give a general capacity formula which is equivalent to the one derived by Verdu and Han.

Affiliated with

Also associated with

No associations

Rating

Simple Channel Coding 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 Simple Channel Coding Bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple Channel Coding Bounds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-720434