|Speaker :||Prof. Manabu Hagiwara (Chiba University)|
|Title :||Perfect Codes for BADs and Other Two Deletions|
|Time :||2017-08-02 (Wed) 15:00 - 16:00|
|Place :||Seminar Room 722, Institute of Mathematics (NTU Campus)|
Construction of deletion error correcting codes is known as
one of the most difficult problems in coding theory.
This talk presents perfect codes for single balanced adjacent
deletions and for other sorts of pairs of deletions.
These codes may be regarded as extension of Levenshtein codes, or VT codes, from a point of view of minuscule heaps which are combinatorial objects related to representations of Weyl groups and Lie algebras.
Parts of this talk were given at ISIT 2017, Aachen, Germany and at SITA 2016, Takayama, Japan.