Storage Codes on Triangle-Free Graphs

发布时间：2026-03-20 作者：浏览次数：

Speaker:	向青	DateTime:	2026年3月21日（周六）下午15:00-16:00
Brief Introduction to Speaker: 向青，南方科技大学		Place:	国交2号楼315会议室
Abstract:Consider a simple, connected graph Γ with n vertices. Let C be a code of length $n$ with its coordinates corresponding to the vertices of Γ. We define C as a storage code on Γ if, for any codeword c ∈ C, the information at each coordinate of c can be recovered by accessing its neighboring coordinates. The main problem here is to construct high-rate storage codes on triangle-free graphs...