School of Technology and Computer Science Seminars
Simple Channel Coding Bounds
by Mr. Naqueeb Warsi (School of Technology and Computer Science)
Friday, March 16, 2012
from
to
(Asia/Kolkata)
at Colaba Campus ( AG-69 )
at Colaba Campus ( AG-69 )
Description |
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. |