»ã±¨±êÌâ (Title)£º¼«´ó²¿ÃŽ¨¸´Â루On maximally recoverable local reconstruction codes£©

»ã±¨ÈË (Speaker)£º ½ðÁá·É ½ÌÊÚ£¨¸´µ©´óѧ£©

»ã±¨¹¦·ò (Time)£º2023Äê5ÔÂ5ÈÕ(ÖÜÎå) 16£º00

»ã±¨µØÖ· (Place)£ºÐ£±¾²¿F309

Ô¼ÇëÈË(Inviter)£º¶¡Ñó

Ö÷°ì²¿ÃÅ£ºÀíѧԺÊýѧϵ

»ã±¨ÌáÒª£ºLocal Reconstruction Codes (LRCs) allow for recovery from a small number of erasures in a local manner based on just a few other codeword symbols. A maximally recoverable (MR) LRC offers the best possible blend of local and global fault tolerance, guaranteeing recovery from all erasure patterns which are information-theoretically correctable given the presence of local recovery groups. In this talk, we introduce some constructions to construct MR LRCs.