【摘要】 常维码作为一种特殊的纠错码，因其在网络编码中的重要作用受到广大学者的关注。为了构造好的常维码，Liu等人通过引入定秩集秩度量码提出了并行构造法。本文主要利用球填充界的思想给出定秩集秩度量码的上界，并通过计算相关参数，获得参数为（n×n,3,[1,2]）₂的定秩集秩度量码的上界。更多还原

【Abstract】 Constant dimension codes（CDCs）,as special error correction codes,have received a lot of attention due to their application in random network coding. In order to construct good CDCs,Liu et al raised the parallel construction by introducing rank metric codes with given ranks（GRMCs）. This paper presents the Hamming upper bounds of GRMCs,and calculates the upper bound of（n×n,3,[1,2]）₂-GRMCs.更多还原