Simple Channel Coding Bounds

by Mr Naqueeb Warsi (School of Technology and Computer Science)

Friday 16 Mar 2012, 15:00 → 16:30 Asia/Kolkata

AG-69 (Colaba Campus)

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 R´enyi’s divergence of order 0.