由MAAC的$(2^m(k-1)+1)$元码构造PDKEEPAAAPDMATHAAB元多用户码
A construction of UD $k$-ary multi-user codes from $(2^m(k-1)+1)$-ary codes for MAAC
摘要：
本文提出了一种用于MAAC的UD $k$ -ary $T$ -user编码方案.本文首先从$k$元$T^{f}$ -用户UD码和$k^{\pm}$元$T^{g}$ -用户差集及其两个分量集$\mathcal{D}^{+}$和$\mathcal{D}^{-}$ { \em a priori}构造出$k$元$T^{f+g}$ -用户UD码.基于由$(2k-1)$元UD码构造的$k^{\pm}$元$T^{g}$元用户差集，从初始多用户码$k$元，$2(k-1)+1$元，\dots元，$(2^m(k-1)+1)$元递归构造了码长为$2^m$的UD $k$元$T$元用户码.由于引入了高阶多用户码，使得生成码$\mathcal{A}$的总码率比常规码高。
英文摘要：
In this paper, we proposed a construction of a UD $k$-ary $T$-user coding scheme for MAAC. We first give a construction of $k$-ary $T^{f+g}$-user UD code from a $k$-ary $T^{f}$-user UD code and a $k^{\pm}$-ary $T^{g}$-user difference set with its two component sets $\mathcal{D}^{+}$ and $\mathcal{D}^{-}$ {\em a priori}. Based on the $k^{\pm}$-ary $T^{g}$-user difference set constructed from a $(2k-1)$-ary UD code, we recursively construct a UD $k$-ary $T$-user codes with code length of $2^m$ from initial multi-user codes of $k$-ary, $2(k-1)+1$-ary, \dots, $(2^m(k-1)+1)$-ary. Introducing multi-user codes with higer-ary makes the total rate of generated code $\mathcal{A}$ higher than that of conventional code.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
