English
Related papers

Related papers: Non-existence of perfect binary sequences

200 papers

Binary Sidel'nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F 2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we…

Information Theory · Computer Science 2017-02-21 Qi Zhang , Jing Yang

The Golomb--Welch conjecture states that there are no perfect $e$-error-correcting codes in $\mathbb{Z}^n$ for $n \ge 3$ and $e \ge 2$. In this note, we prove the nonexistence of perfect $2$-error-correcting codes for a certain class of…

Combinatorics · Mathematics 2017-06-01 Dongryul Kim

We consider sequences of the form $\left(a_{n} \alpha\right)_{n}$ mod 1, where $\alpha\in\left[0,1\right]$ and where $\left(a_{n}\right)_{n}$ is a strictly increasing sequence of positive integers. If the asymptotic distribution of the pair…

Number Theory · Mathematics 2019-07-24 Christoph Aistleitner , Thomas Lachmann , Niclas Technau

The existence of an extremal self-dual binary linear code of length 120 is a long-standing open problem. We continue the investigation of its automorphism group, proving that automorphisms of order 30 and 57 cannot occur. Supposing the…

Information Theory · Computer Science 2017-11-10 Martino Borello , Javier de la Cruz

1. There is no existing any quadratic interval $\eta_{n}:=(n^{2},(n+1)^{2}],$ which contains less than 2 prime numbers. The number of prime numbers within $\eta_{n}$ goes averagely linear with n to infinity. 2. The exact law of the number…

General Mathematics · Mathematics 2015-09-02 Hans Walther Ernst Gerhart Schmidt

It is an open question whether the fractional parts of nonlinear polynomials at integers have the same fine-scale statistics as a Poisson point process. Most results towards an affirmative answer have so far been restricted to almost sure…

Number Theory · Mathematics 2019-02-20 Jens Marklof , Nadav Yesha

The Vafa-Witten equations on an oriented Riemannian 4- manifold are first order, non-linear equations for a pair of connection on a principle SO(3) bundle over the 4-manifold and a self-dual 2-form with values in the associated Lie algebra…

Differential Geometry · Mathematics 2017-08-15 Clifford Henry Taubes

A construction of 2-quasi-perfect Lee codes is given over the space $\mathbb Z_p^n$ for $p$ prime, $p\equiv \pm 5\pmod{12}$ and $n=2[\frac{p}{4}]$. It is known that there are infinitely many such primes. Golomb and Welch conjectured that…

Information Theory · Computer Science 2017-06-26 Cristóbal Camarero , Carmen Martínez

Ternary constant weight codes of length $n=2^m$, weight $n-1$, cardinality $2^n$ and distance $5$ are known to exist for every $m$ for which there exists an APN permutation of order $2^m$, that is, at least for all odd $m \geq 3$ and for…

Information Theory · Computer Science 2016-05-10 Denis S. Krotov , Patric R. J. Östergård , Olli Pottonen

Kim et al. (2021) gave a method to embed a given binary $[n,k]$ code $\mathcal{C}$ $(k = 3, 4)$ into a self-orthogonal code of the shortest length which has the same dimension $k$ and minimum distance $d' \ge d(\mathcal{C})$. We extend this…

Information Theory · Computer Science 2022-06-28 Jon-Lark Kim , Whan-Hyuk Choi

Borwein and Mossinghoff investigated the Rudin-Shapiro-like sequences, which are infinite families of binary sequences, usually represented as polynomials. Each family of Rudin-Shapiro-like sequences is obtained from a starting sequence…

Information Theory · Computer Science 2020-07-16 Daniel J. Katz , Sangman Lee , Stanislav A. Trunov

For certain negative rational numbers k0, called singular values, and associated with the symmetric group S_N on N objects, there exist homogeneous polynomials annihilated by each Dunkl operator when the parameter k = k0. It was shown by de…

Representation Theory · Mathematics 2009-09-04 Charles F. Dunkl

A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length 16 was recently carried out in [P. R. J. \"Osterg{\aa}rd and O. Pottonen, "The perfect binary one-error-correcting…

Information Theory · Computer Science 2010-10-07 Patric R. J. Östergård , Olli Pottonen , Kevin T. Phelps

Let $1<g_1<\ldots<g_{\varphi(p-1)}<p-1$ be the ordered primitive roots modulo~$p$. We study the pseudorandomness of the binary sequence $(s_n)$ defined by $s_n\equiv g_{n+1}+g_{n+2}\bmod 2$, $n=0,1,\ldots$. In particular, we study the…

Number Theory · Mathematics 2021-05-18 Arne Winterhof , Zibi Xiao

In this paper we study the non-existence problem of (nearly) perfect (almost) $m$-ary sequences via their connection to (near) Butson-Hadamard (BH) matrices and (near) conference matrices. Firstly, we apply a result on vanishing sums of…

Number Theory · Mathematics 2014-07-25 Arne Winterhof , Oğuz Yayla , Volker Ziegler

The no-signaling constraint on bi-partite correlations is reviewed. It is shown that in order to obtain non-trivial Bell-type inequalities that discern no-signaling correlations from more general ones, one must go beyond considering…

Quantum Physics · Physics 2011-08-22 M. P. Seevinck

In this paper, we study the sequences with (non-consecutive) two zero-symbols and ideal autocorrelation, which are also known as almost $m$-ary nearly perfect sequences. We show that these sequences are equivalent to $\ell$-partial direct…

Combinatorics · Mathematics 2020-05-27 Büşra Özden , Oğuz Yayla

We identify a class of finite quantum systems, namely, acyclic systems whose transition graph is a directed acyclic graph (DAG), for which the Born series collapses into an exact algebraic identity with finitely many terms and strictly zero…

Quantum Physics · Physics 2026-05-13 Ramon Moya

We prove that an automorphism of order 3 of a putative binary self-dual [120, 60, 24] code C has no fixed points. Moreover, the order of the automorphism group of C divides 2^a.3.5.7.19.23.29 where a is a nonegative integer. Automorphisms…

Combinatorics · Mathematics 2018-09-20 Stefka Bouyuklieva , Javier de la Cruz , Wolfgang Willems

The Binary Two-Up Sequence is the lexicographically earliest sequence of distinct nonnegative integers with the property that the binary expansion of the n-th term has no 1-bits in common with any of the previous floor(n/2) terms. We show…

Combinatorics · Mathematics 2022-09-12 Michael De Vlieger , Thomas Scheuerle , Rémy Sigrist , N. J. A. Sloane , Walter Trump
‹ Prev 1 3 4 5 6 7 10 Next ›