线性布尔分类、编码与“临界问题”
Linear Boolean classification, coding and "the critical problem"
摘要:
考虑GF(2)上核不与给定集合S相交的极小秩矩阵的构造问题。在S是以0为中心的汉明球的情况下,这等价于找到最大维度的线性码。对于一般集合,这是Crapo和Rota在1970年提出的“临界问题”的一个实例。这项工作的重点是S是一个环的情况下。与球相反,它表明,最佳内核不仅由密集的,而且稀疏的向量,并确定在各种情况下的最佳混合物。这些发现证实了一个猜想,即对于内外半径分别为nq和np的环,最优相对秩由(1-q)H(p/(1-q))给出,这是对半径为np的Hamming球的Gilbert-Varshamov界H(p)的推广.
英文摘要:
The problem of constructing a minimal rank matrix over GF(2) whose kernel does not intersect a given set S is considered. In the case where S is a Hamming ball centered at 0, this is equivalent to finding linear codes of largest dimension. For a general set, this is an instance of "the critical problem" posed by Crapo and Rota in 1970. This work focuses on the case where S is an annulus. As opposed to balls, it is shown that an optimal kernel is composed not only of dense but also of sparse vectors, and the optimal mixture is identified in various cases. These findings corroborate a proposed conjecture that for annulus of inner and outer radius nq and np respectively, the optimal relative rank is given by (1-q)H(p/(1-q)), an extension of the Gilbert-Varshamov bound H(p) conjectured for Hamming balls of radius np.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。