Related papers: Non-existence of perfect binary sequences
We give a complete characterization of simple graphs whose adjacency matrices generate binary linear complementary dual (LCD) codes. In particular, we completely characterize a distance-regular graph which yields an LCD code in terms of the…
Cyclic codes are an important subclass of linear codes with wide applications in communication systems and data storage systems. In 2013, Ding and Helleseth presented nine open problems on optimal ternary cyclic codes $\mathcal{C}_{(1,e)}$.…
We show that for every length of form $4^k-1$, there exists a binary $1$-perfect code that does not include any Preparata-like code.
A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length 16 is presented. There are 5983 such inequivalent perfect codes and 2165 extended perfect codes. Efficient…
A computer calculation with Magma shows that there is no extremal self-dual binary code C of length 72, whose automorphism group contains the symmetric group of degree 3, the alternating group of degree 4 or the dihedral group of order 8.…
Complex-valued periodic sequences, u, constructed by Goran Bjorck, are analyzed with regard to the behavior of their discrete periodic narrow-band ambiguity functions A_p(u). The Bjorck sequences, which are defined on Z/pZ for p>2 prime,…
Semi-regular sequences over $\mathbb{F}_2$ are sequences of homogeneous elements of the algebra $ B^{(n)}=\mathbb{F}_2[X_1,...,X_n]/(X_1^2,...,X_n^2) $, which have as few relations between them as possible. They were introduced in order to…
The asyptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids. The connection to a result of Lefmann, Roedl, Phelps is explored. The latter states that almost all…
In this paper we study nearly perfect sequences (NPS) via their connection to direct product difference sets (DPDS). We prove the connection between a $p$-ary NPS of period $n$ and type $\gamma$ and a cyclic…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Perfect nonlinear monomials were employed to…
We consider extended $1$-perfect codes in Hamming graphs $H(n,q)$. Such nontrivial codes are known only when $n=2^k$, $k\geq 1$, $q=2$, or $n=q+2$, $q=2^m$, $m\geq 1$. Recently, Bespalov proved nonexistence of extended $1$-perfect codes for…
This paper explores the proof by J. Bourgain, H. Furstenberg, Y. Katznelson and D.S. Ornstein of their return times theorem [2] and lights a corner in it regarding the role of auto-correlation. As for pointwise convergence, this was already…
Novel sequences of approximants to solutions of Painlev\'e II on finite intervals of the real line, with Neumann boundary conditions, are constructed. Numerical experiments strongly suggest convergence of these sequences in a surprisingly…
The arithmetic crosscorrelation of binary $m$-sequences with coprime periods $2^{n_1}-1$ and $2^{n_2}-1$\ ($\gcd(n_1,n_2)=1$) is determined. The result shows that the absolute value of arithmetic crosscorrelation of such binary…
Binary self-dual sequences have been considered and analyzed throughout the years, and they have been used for various applications. Motivated by a construction for single-track Gray codes, we examine the structure and recursive…
We construct a four-term exact sequence which provides information on the kernel and cokernel of the multiplication by a pure symbol in Milnor's K-theory mod 2 of fields of characteristic zero. As an application we establish, for fields of…
${\cal N} = 8$ superconformal field theories, such as the ABJM theory at Chern-Simons level $k=1$ or $2$, contain 35 scalar operators ${\cal O}_{IJ}$ with $\Delta=1$ in the ${\bf 35}_v$ representation of SO(8). The 3-point correlation…
An ordered pair of semi-infinite binary sequences $(\eta,\xi)$ is said to be compatible if there is a way of removing a certain number (possibly infinite) of ones from $\eta$ and zeroes from $\xi$, whichwould map both sequences to the same…
We show that any binary $(n=2^m-3, 2^{n-m}, 3)$ code $C_1$ is a part of an equitable partition (perfect coloring) $\{C_1,C_2,C_3,C_4\}$ of the $n$-cube with the parameters $((0,1,n-1,0)(1,0,n-1,0)(1,1,n-4,2)(0,0,n-1,1))$. Now the…
Pseudorandom binary sequences with optimal balance and autocorrelation have many applications in stream cipher, communication, coding theory, etc. It is known that binary sequences with three-level autocorrelation should have an almost…