Construction of Binary Array Codes Based on Matrix Transformation

来源: 发布时间:2024-04-15 点击: Views

报告人:黄勤 教授(北京航空航天大学)


报告地点:大学城校区 工学一号馆204室

主持人:方毅 教授


This paper proposes to construct binary array codes from non-binary codes by binary matrix dispersion. Thanks to their low-density and quasi-cyclic (QC) generator matrices, the proposed codes enjoy low encoding complexity, about 1/(m+1) of the XOR operations used in their counterparts over GF(2m). Their maximum distance separable (MDS) property and repair can be efficiently analyzed via matrix transformation. The MDS property is ensured by introducing Vandermonde upper triangular form and pre-processing. Moreover, the efficient repair can be guaranteed by applying a matrix mapping called all-one superposition on the associated matrices. undefinedysis indicates that their code rate and repair ratio asymptotically approach those of their non-binary counterparts.


黄勤教授,国家级青年人才,东南大学学士、硕士,加州大学戴维斯分校博士,北京航空航天大学教授,IEEE高级会员。从事信道编码理论与应用研究,主持国家自然科学基金重点项目等,所设计的编码和译码被采纳为一重大工程的国家标准。2017年任IEEE Trans. Communications编委,入选中国科协青年托举人才工程;2019年获北京高校青教赛一等奖;2020年入选国家级青年人才计划;2022年获华为火花奖;2023年获北京市自然科学奖二等奖(排名1/3)。