◈ 학술지
◈ 도서
◈ 전자학술지
◈ 투고요령
◈ 수학신간도서
◈ MSC
◈ 논문검색
◈ 학술행사
홈 > 학술정보 >학술행사 > 세미나
한국고등과학원 세미나

Title
MDS codes in Doob graphs.
Speaker
Denis Krotov   (Sobolev Institute of Mathematics )
Date
2017-08-11 16:00:00
Host
KIAS
Place
7323
Abstract
A set of vertices of the Doob graph $D(m,n)$ is called an MDS code if its cardinality and code distance are the same as the cardinality and the code distance of a usual MDS code in the Hamming graph $H(2m+n,4)$. As in the Hamming case, such codes are optimal. We consider the characterization of the MDS codes in Doob graphs.
개인정보보호정책 l 이메일주소집단수집금지 l 뷰어다운로드
qr코드