Group:Theory Lunch
Title: Space-bounded Communication Complexity
Speaker: Changcun Ma, Hao Song University
Time: 2010-10-28 12:00-2010-10-28 13:30
Venue: FIT 1-222

Abstract:

Speaker: Changcun Ma

 

Different metric is used for different noise model in coding theory. Hamming metric is good for WGN. For network coding and error control code, rank metric is useful. In this talk, I will first briefly introduce some basic notions of coding theory in case that some of you might not be familiar. Then I will present a result about the decoding radius of general rank metric codes, followed by some open problems.

 

Speaker: Hao Song

 

Title: Space-bounded Communication Complexity

Abstract: In this talk I will give an introduction to space-bounded communication complexity. It is a concept introduced by Periklis (that I know of). I'll talk about the motivations for introducing this concept, our ideas about how to define the underlying model, the difference between this model and the traditional communication complexity model, some preliminary results we’ve got so far, and possible research directions.



Short Bio: