Number Theory and Polynomials: The merit factor problem
Number Theory and Polynomials: The merit factor problem
复制标题
数论和多项式：优值因子问题
DOI：
10.1017/cbo9780511721274.006
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
J. Knauer
中科院分区：
文献类型：
--
作者：
P. Borwein;Ron Ferguson;J. Knauer
优值因子问题是通信工程师感兴趣的实际问题，也是数学家感兴趣的理论问题。对于二进制序列，虽然通常认为优点因子是有界的，但仍然没有完全确定每个都具有优点因子N的偶数长度Barker序列的数目是有界的。在这篇文章中，我们概述了这个问题和我们进行的相当广泛的搜索的结果，搜索的长度高达略高于200。
The merit factor problem is of considerable practical interest to communications engineers and theoretical interest to number theorists. For binary sequences, although it is generally believed that the merit factor is bounded, it still has not been completely established that the number of even length Barker sequences, each with merit factor N , is bounded. In this paper, we present an overview of the problem and results of quite extensive searches we have conducted in lengths up to slightly beyond 200.