This talk is based on "Simple channel coding bounds" by Wang et al, ISIT, 2009. New channel coding converse and achievability bounds are derived for a single use of an arbitrary channel.
Problems in Metric embedding involve mapping a set (for our purposes, finite) of points from one metric space to another, while preserving pairwise distances.
In this talk, we discuss the problem of data transmission in a single input, multiple output wireless communication system with channel estimation at both transmitter and receiver, from a Diversity- Multiplexing gain Trade-off (DMT) perspective.
I will introduce a very simple social interaction model of information transmission, opinion formation and consensus formation by De Groot. We will study sufficient and necessary conditions to converge to a consensus in very simple networks.
Slepian and Wolf gave the rate-region for the distributed encoding of correlated and memoryless sources when the number of copies of source output is unlimited.
This talk attempts to provide an introductory survey of methods for rearranging cargo trains in railway yards from an algorithmic perspective, and to highlight open problems in this area.
