删除校正码和优势向量
Deletion-correcting codes and dominant vectors
摘要：
在本文中，我们描述了所有的二进制向量对$({\bf u}, {\bf v})$，使得在${\bf v}$中通过$t$删除获得的向量集是在$t=1,2$的${\bf u}$中通过$t$删除获得的向量集的子集。这样的对对于找到$L_2(n,t)$的值，即二进制$t$的最大基数-长度为$n$的删除校正码起着重要的作用。
英文摘要：
In this paper we describe all pairs of binary vectors $({\bf u}, {\bf v})$ such that the set of vectors obtained by $t$ deletions in ${\bf v}$ is a subset of the set of vectors obtained by $t$ deletions in ${\bf u}$ for $t=1,2$. Such pairs play an important role for finding the value of $L_2(n,t)$, the maximum cardinality of binary $t$-deletion-correcting code of length $n$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
