BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Feedback Capacity and Coding for Binary-Input Memoryless Channels 
 with a No-Consecutive-Ones Input Constraint
DTSTART:20190521T151500
DTEND:20190521T161500
DTSTAMP:20260407T152724Z
UID:2bacac68fd4267c45942da996c23749e7f52f25cfc05377383b8841e
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Navin Kashyap - IIT Bangalore\n  We consider the input-
 constrained feedback capacity of certain binary-input\nmemoryless channels
 . Here\, the channel inputs are constrained to be binary sequences in whic
 h consecutive 1s are disallowed\, and the channel output at the end of one
  transmission is fed back to the transmitter ahead of the next transmissio
 n. It is known that the capacity computation for such channels can be form
 ulated as an average-reward dynamic program (DP). In the case of the binar
 y erasure channel\, we obtain an exact expression for the capacity by expl
 icitly solving the Bellman equation associated with the DP formulation. Fu
 rthermore\, the optimal policy of the DP leads to a simple and elegant zer
 o-error coding scheme that achieves capacity. More generally\, for any bin
 ary-input\, binary-output channel\, we are able to obtain an explicit expr
 ession for feedback capacity under the no-consecutive-1s input constraint 
 by solving a Bellman equation. In particular\, our results apply to the bi
 nary symmetric channel and the Z channel. The optimal policy for the DP yi
 elds a capacity-achieving coding scheme based on the posterior matching pr
 inciple.\n\n   This is joint work with Oron Sabag and Haim Permuter (Ben
 -Gurion University\, Israel).
LOCATION:INR 113 https://plan.epfl.ch/?room=INR113
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR