arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0601036cs.ITmath.IT
收藏

关于避免禁止差分模式的码容量计算的复杂性

On the complexity of computing the capacity of codes that avoid forbidden difference patterns

Vincent D. Blondel, Raphael Jungers, Vladimir Protasov

摘要:

我们考虑有关的问题,避免禁止的差异模式的代码的能力的计算。最大的$n$比特序列的两两差异不包含某些给定的禁止差异模式的数量与$n$呈指数增长。指数是禁止模式的容量,其由从禁止差异模式构造的一组矩阵的联合谱半径的对数给出。我们提供了一个新的家庭的界限,允许近似,在指数时间,任意高精度的能力。我们还提供了一个多项式时间算法的问题,确定一组的能力是积极的,但我们证明了同样的问题成为NP-困难时,禁止模式的集合定义在一个扩展的符号集。最后,我们证明了在容量计算中出现的矩阵集的极值范数的存在性。该结果使得可以应用特定(即使非多项式)近似算法。我们说明了这一事实,通过精确计算的能力的代码,只有大约知道。

英文摘要:

We consider questions related to the computation of the capacity of codes that avoid forbidden difference patterns. The maximal number of $n$-bit sequences whose pairwise differences do not contain some given forbidden difference patterns increases exponentially with $n$. The exponent is the capacity of the forbidden patterns, which is given by the logarithm of the joint spectral radius of a set of matrices constructed from the forbidden difference patterns. We provide a new family of bounds that allows for the approximation, in exponential time, of the capacity with arbitrary high degree of accuracy. We also provide a polynomial time algorithm for the problem of determining if the capacity of a set is positive, but we prove that the same problem becomes NP-hard when the sets of forbidden patterns are defined over an extended set of symbols. Finally, we prove the existence of extremal norms for the sets of matrices arising in the capacity computation. This result makes it possible to apply a specific (even though non polynomial) approximation algorithm. We illustrate this fact by computing exactly the capacity of codes that were only known approximately.

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

↑