Reconstruction problem: old and new results
主 讲 人 :Elena Konstantinova 副教授
活动时间:08月19日14时00分
地 点 :理科群1号楼C105
讲座内容:
In this talk we consider a reconstruction problem which was originally stated in coding theory but it has a combinatorial context. This problem is equivalent to finding the largest intersection of two metric balls of a given radius. We are interested on this problem with respect to permutations under different metrics. First, we give a short overview of some old results. Second, we present some new results for permutations over the Hamming metric. These results are based on a recent work with Xiang Wang.
主讲人介绍:
Elena Konstantinova,,现任三峡大学三峡数学研究中心(Three Gorges Mathematical Research Center, CTGU)副教授。