array(2) { ["lab"]=> string(4) "1545" ["publication"]=> string(5) "14761" } New constant dimension subspace codes from multilevel linkage construction - 密码编码实验室 | LabXing

密码编码实验室

简介 研究方向：编码理论/信息论/抗量子密码/通信安全等

大学 暨南大学 / 网络空间安全学院
关注
分享到

New constant dimension subspace codes from multilevel linkage construction

2022
期刊 Advances in Mathematics of Communications
作者 Huimin Lao · Hao Chen
下载全文
<p style='text-indent:20px;'>One of the main problems in subspace coding is to determine the maximal possible size of a constant dimension subspace code with given parameters. In this paper, we introduce a family of new codes, named rank-restricted Ferrers diagram rank-metric codes, to give an improved construction of constant dimension subspace codes. Our method constructs many new CDCs with larger sizes than previously best-known codes.</p>

LabXing 上可以免费创建课题组网站
© LabXing 2018 关于LabXing 帮助中心 testing.service 京公网安备11010802025734号