題目：Improved Bounds and Optimal Constructions of Locally Repairable Codes

主講人：方偉軍

時間：7月13日10:00

地點：文理大樓723室

報告摘要：

   Locally repairable codes (LRCs) as a new coding scheme have given more rise to the system performance and attracted a lot of interest in the theoretical research in coding theory. In this talk, we first of all derive an improved and general upper bound on the code length of Singleton-optimal LRCs with minimum distanced= 5, 6, some known constructions are shown to exactly achieve our new bound, which verifies its tightness. Moreover, we obtain a complete characterization for Singleton-optimal LRCs with r = 2 and d = 6. Furthermore, we employ the well-known line-point incidence matrix and Johnson bounds for constant weight codes to derive tighter upper bounds on the code length. To the best of our knowledge, this is the best bound on the code length of optimal (n, k, 6; 2)-LRCs until now.

主講人簡介：

方偉軍研究員2019年博士畢業于南開大學陳省身數學研究所，2019-2021年于清華大學深圳國際研究生院從事博士后工作；2021年9月起就職于山東大學網絡空間安全學院。主要研究方向為代數編碼及其在量子糾錯碼、分布式存儲編碼等前沿課題中的應用。在TIT、TCOM、DCC、FFA、CCDS以及ISIT、ITW等信息論與編碼理論期刊與會議發表二十余篇論文。目前主持1項國家自然科學青年基金，1項省自然科學青年基金，作為學術骨干參與2項國家重點研發計劃，入選山東省泰山學者青年專家計劃，獲得山東大學齊魯青年學者。