最优等差避障码
Optimal Equi-difference Conflict-avoiding Codes
摘要:
长度为$n$、重量为$ω$的等重冲突避免码$(CAC^{e})\ \mathcal{C}$是$ω$子集的集合(称为码字),其具有$\mathbb{Z}_{n}$的$\{0,i,2i,\cdots,(ω-1)i\}$形式,使得$Δ(c_{1})\capΔ(c_{2})=\emptyset$对于任何$c_{1},\ c_{2}\in\mathcal{C}$成立,$c_{1}\neq c_{2}$其中$Δ(c)=\{j-i \ (\mbox{mod}\ n) \; | \; i,j\in c,i\neq j\}.$对于给定的$n$和$ω$具有最大码大小的码$\mathcal{C}\in CAC^{e}s$被称为最优的并且被称为完美的,如果$\cup_{c\in \mathcal{C}}Δ(c)=\mathbb{Z}_{n}\backslash \{0\}.$在本文中,我们展示了如何在一定条件下将$\mathcal{C}_{1}\in CAC^{e}(q_{1},ω)$和$\mathcal{C}_{2}\in CAC^{e}(q_{2},ω)$组合成$\mathcal{C}\in CAC^{e}(q_{1}q_{2},ω)$。给出了长度为$q_{1}q_{2}$、重量为$ω$的$CAC^{e}$为最优的一个必要条件。我们还考虑了奇素数$p$和权$ω\geq3$的完全$\mathcal{C}\in CAC^{e}(p,ω)$的显式构造。最后,对于正整数$k$和素数$p\equiv1 \ (\mbox{mod}\ 4k)$,我们考虑了拟完全$\mathcal{C}\in CAC^{e}(2p,4k+1)$的显式构造。
英文摘要:
An equi-differece conflict-avoiding code $(CAC^{e})\ \mathcal{C}$ of length $n$ and weight $ω$ is a collection of $ω$-subsets (called codewords) which has the form $\{0,i,2i,\cdots,(ω-1)i\}$ of $\mathbb{Z}_{n}$ such that $Δ(c_{1})\capΔ(c_{2})=\emptyset$ holds for any $c_{1},\ c_{2}\in\mathcal{C}$, $c_{1}\neq c_{2}$ where $Δ(c)=\{j-i \ (\mbox{mod}\ n) \; | \; i,j\in c,i\neq j\}.$ A code $\mathcal{C}\in CAC^{e}s$ with maximum code size for given $n$ and $ω$ is called optimal and is said to be perfect if $\cup_{c\in \mathcal{C}}Δ(c)=\mathbb{Z}_{n}\backslash \{0\}.$ In this paper, we show how to combine a $\mathcal{C}_{1}\in CAC^{e}(q_{1},ω)$ and a $\mathcal{C}_{2}\in CAC^{e}(q_{2},ω)$ into a $\mathcal{C}\in CAC^{e}(q_{1}q_{2},ω)$ under certain conditions. One necessary condition for a $CAC^{e}$ of length $q_{1}q_{2}$ and weight $ω$ being optimal is given. We also consider explicit construction of perfect $\mathcal{C}\in CAC^{e}(p,ω)$ of odd prime $p$ and weight $ω\geq3$. Finally, for positive integer $k$ and prime $p\equiv1 \ (\mbox{mod}\ 4k)$, we consider explicit construction of quasi-perfect $\mathcal{C}\in CAC^{e}(2p,4k+1)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。