作为Grassmannian码理想的矩阵码及其重量性质
Matrix Codes as Ideals for Grassmannian Codes and their Weight Properties
摘要:
给出了一种构造素域$GF(p)$上矩阵码提升子空间距离的格拉斯曼码的系统方法。矩阵码是$GF(p)$上的$2 \times 2$矩阵的环$M_2(GF(p))$的$GF(p)$ -子空间,在其上应用秩度量,并且由$M_2(GF(p))$的幂等元生成为单侧真主理想。在此基础上,利用等价齐次条件研究了非交换矩阵环$M_2(GF(p))$上的权函数,即$p$的幂函数$q$. $M_2(GF(q))$的秩权分布完全由一般线性群$GL(2,q)$决定。最后,本文用类似的方法定义了子空间码的权函数,并研究了它的平等性。
英文摘要:
A systematic way of constructing Grassmannian codes endowed with the subspace distance as lifts of matrix codes over the prime field $GF(p)$ is introduced. The matrix codes are $GF(p)$-subspaces of the ring $M_2(GF(p))$ of $2 \times 2$ matrices over $GF(p)$ on which the rank metric is applied, and are generated as one-sided proper principal ideals by idempotent elements of $M_2(GF(p))$. Furthermore a weight function on the non-commutative matrix ring $M_2(GF(p))$, $q$ a power of $p$, is studied in terms of the egalitarian and homogeneous conditions. The rank weight distribution of $M_2(GF(q))$ is completely determined by the general linear group $GL(2,q)$. Finally a weight function on subspace codes is analogously defined and its egalitarian property is examined.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。