当前位置:
X-MOL 学术
›
IEEE Trans. Inform. Theory
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
1-Perfect Codes Over the Quad-Cube
IEEE Transactions on Information Theory ( IF 2.5 ) Pub Date : 2022-05-26 , DOI: 10.1109/tit.2022.3172924 Pranava K. Jha 1
IEEE Transactions on Information Theory ( IF 2.5 ) Pub Date : 2022-05-26 , DOI: 10.1109/tit.2022.3172924 Pranava K. Jha 1
Affiliation
A vertex subset $S$ of a graph $G$ constitutes a 1-perfect code if the one-balls centered at the nodes in $S$ effect a vertex partition of $G$
. This paper considers the quad-cube $CQ_{m}$ that is a connected $(m+2)$
-regular spanning subgraph of the hypercube $Q_{4m+2}$
, and shows that $CQ_{m}$ admits a vertex partition into 1-perfect codes iff $m=2^{k}-3$
, where $k\ge 2$
. The scheme for that purpose makes use of a procedure by Jha and Slutzki that constructs Hamming codes using a Latin square. The result closely parallels the existence of a 1-perfect code over the dual-cube, which is another derivative of the hypercube.
中文翻译:
1-四方立方体上的完美代码
一个顶点子集 $新元 图的 $G$ 如果 one-balls 以节点为中心,则构成 1 完美码 $新元 实现顶点分割 $G$
. 本文考虑四方 $CQ_{m}$ 那是一个连接的 $(m+2)$
- 超立方体的正则跨越子图 $Q_{4m+2}$
,并表明 $CQ_{m}$ 承认一个顶点划分为 1-完美代码 iff $m=2^{k}-3$
, 在哪里 $k\ge 2$
. 用于该目的的方案使用了 Jha 和 Slutzki 的程序,该程序使用拉丁方构造汉明码。结果与双立方体上存在 1 完美码非常相似,它是超立方体的另一个导数。
更新日期:2022-05-26
中文翻译:
1-四方立方体上的完美代码
一个顶点子集