
The Constant of Proportionality in Lower Bound Constructions of PointLine Incidences
Let I(n,l) denote the maximum possible number of incidences between n po...
read it

A new upper bound and optimal constructions of equidifference conflictavoiding codes on constant weight
Conflictavoiding codes (CACs) have been used in multipleaccess collisi...
read it

Robust Positioning Patterns with Low Redundancy
A robust positioning pattern is a large array that allows a mobile devic...
read it

Novel Results on the Number of Runs of the BurrowsWheelerTransform
The BurrowsWheelerTransform (BWT), a reversible string transformation,...
read it

The Simplest Binary Word with Only Three Squares
We reexamine previous constructions of infinite binary words containing...
read it

Low discrepancy sequences failing Poissonian pair correlations
M. Levin defined a real number x that satisfies that the sequence of the...
read it

Information Theoretic Bound on Optimal Worstcase Error in Binary Mixture Identification
Identification of latent binary sequences from a pool of noisy observati...
read it
Investigating the discrepancy property of de Bruijn sequences
The discrepancy of a binary string refers to the maximum (absolute) difference between the number of ones and the number of zeroes over all possible substrings of the given binary string. We provide an investigation of the discrepancy of known simple constructions of de Bruijn sequences. Furthermore, we demonstrate constructions that attain the lower bound of Θ(n) and a new construction that attains the previously known upper bound of Θ(2^n/√(n)). This extends the work of Cooper and Heitsch [Discrete Mathematics, 310 (2010)].
READ FULL TEXT
Comments
There are no comments yet.