$\mathcal{H}_{q}(n,w)$的最优$(n,d,w)_{q}$码的铺砌
Tilings of $\mathcal{H}_{q}(n,w)$ with optimal $(n,d,w)_{q}$-codes
AI总结:
本文研究了$\mathcal{H}_{q}(n,w)$的最优$(n,d,w)_{q}$码铺砌问题,提出了多种构造方法,并解决了特定参数下的存在性问题。
摘要:
度量空间$\mathcal{H}_{q}(n,w)$是所有长度为$n$、重量为$w$的$\mathbb{Z}_{q}$字母上的单词集合,在汉明距离度量下。一个$q$进制等重码,作为$\mathcal{H}_{q}(n,w)$的非空子集,一直是编码理论中的基本课题。本文研究了将$\mathcal{H}_{q}(n,w)$用最优$(n,d,w)_{q}$码进行铺砌的问题,简称为$\mathrm{TOC}_{q}(n,d,w)$,即$\mathcal{H}_{q}(n,w)$被互不重叠的最优$q$进制等重码划分。当距离$d$为奇数时,我们研究了广义斯坦纳系统的大量集合。当$d$为偶数时,我们定义了广义最大H-包的大量集合。我们提出了几种通用构造方法,用于通过$t$-可解斯坦纳系统和完全超图的近正则边着色生成$\mathrm{TOC}_{q}(n,d,w)$。对于$d=2$和$d=2w$的情况,我们完全解决了所有参数$q,n$和$w$的$\mathrm{TOC}_{q}(n,d,w)$的存在问题。特别是,我们关注重量为三的铺砌。对于二进制情况和重量为三的情况,$\mathrm{TOC}_{2}(n,d,3)$的存在问题完全得到解决。对于特定的字母表大小$q\ge 3$,我们得到了许多无限族的$\mathrm{TOC}_{q}(n,d,3)$,对于距离$d=3,4,5$。
英文摘要:
The metric space $\mathcal{H}_{q}(n,w)$ is the set of all words of length $n$ with weight $w$ over the alphabet $\mathbb{Z}_{q}$, under the Hamming distance metric. A $q$-ary constant-weight code, as a nonempty subset of $\mathcal{H}_{q}(n,w)$, has always been a fundamental topic in coding theory. This paper investigates the tiling problem of $\mathcal{H}_{q}(n,w)$ with optimal $(n,d,w)_{q}$-codes, simply denoted by $\mathrm{TOC}_{q}(n,d,w)$, meaning a partition of $\mathcal{H}_{q}(n,w)$ into mutually disjoint optimal $q$-ary constant-weight codes with distance $d$. When the distance $d$ is odd, we investigate large sets of generalized Steiner systems. When $d$ is even, we define large sets of generalized maximum H-packings. We present several general construction approaches for generating $\mathrm{TOC}_{q}(n,d,w)$s via $t$-resolvable Steiner systems and almost-regular edge-colorings of complete hypergraphs. For the cases $d=2$ and $d=2w$, we completely resolve the existence problem of $\mathrm{TOC}_{q}(n,d,w)$s for all parameters $q,n$ and $w$. Particularly, we pay attention to tilings for weight three. For binary case and weight three, the existence problem of $\mathrm{TOC}_{2}(n,d,3)$s is totally resolved. For specific alphabet size $q\ge 3$, we obtain many infinite families of $\mathrm{TOC}_{q}(n,d,3)$s for distances $d=3,4,5$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。