arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0901.3170cs.ITcs.DMmath.IT
收藏

关于线性平衡集

On linear balancing sets

Arya Mazumdar, Ron M. Roth, Pascal O. Vontobel

摘要:

设n为偶数,F为域\GF(2). F^n中的一个词被称为平衡的,如果它的汉明重量是n/2。一个子集C \subseteq F^n$被称为平衡集,如果对于每个词y \in F^n都有一个词x \in C使得y + x是平衡的。证明了F^n中维数略大于3/2 \log_2(n)的线性子空间大多数是平衡集.这一结果的推广线性子空间的“几乎平衡”也提出。另一方面,证明了判定F^n中给定向量集是否跨越平衡集的问题是NP-困难的。线性平衡集的应用,提出了设计有效的纠错编码方案,其中码字是平衡的。

英文摘要:

Let n be an even positive integer and F be the field \GF(2). A word in F^n is called balanced if its Hamming weight is n/2. A subset C \subseteq F^n$ is called a balancing set if for every word y \in F^n there is a word x \in C such that y + x is balanced. It is shown that most linear subspaces of F^n of dimension slightly larger than 3/2\log_2(n) are balancing sets. A generalization of this result to linear subspaces that are "almost balancing" is also presented. On the other hand, it is shown that the problem of deciding whether a given set of vectors in F^n spans a balancing set, is NP-hard. An application of linear balancing sets is presented for designing efficient error-correcting coding schemes in which the codewords are balanced.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑