单位图关联矩阵的线性码
Linear Codes from Incidence Matrices of Unit Graphs
摘要：
研究了点集为$\mathbb{Z}_{n}$且两个不同点$x$和$y$相邻的单位图$G(\mathbb{Z}_{n})$的关联矩阵关于汉明度量的二元线性码当且仅当$x+y$是单位图.给出了编码的主要参数。
英文摘要：
In this paper, we examine the binary linear codes with respect to Hamming metric from incidence matrix of a unit graph $G(\mathbb{Z}_{n})$ with vertex set is $\mathbb{Z}_{n}$ and two distinct vertices $x$ and $y$ being adjacent if and only if $x+y$ is unit. The main parameters of the codes are given.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
