Related papers: Low Autocorrelation Binary Sequences: Number Theor…

FRB 20180916B is a well-studied repeating fast radio burst source. Its proximity (~150 Mpc), along with detailed studies of the bursts, have revealed many clues about its nature -- including a 16.3-day periodicity in its activity. Here we…

Contact binary star systems represent the long-lived penultimate phase of binary evolution. Population statistics of their physical parameters inform understanding of binary evolutionary pathways and end products. We use light curves and…

The AWGNC, BSC, and max-fractional pseudocodeword redundancies of a binary linear code are defined to be the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming…

A correlation between the intrinsic energy and the burst duration of non-repeating fast radio bursts (FRBs) has been reported. If it exists, the correlation can be used to estimate intrinsic energy from the duration, and thus can provide us…

Post-processing of the raw bits produced by a true random number generator (TRNG) is always necessary when the entropy per bit is insufficient for security applications. In this paper, we derive a tight bound on the output min-entropy of…

We present an approach to identifying and characterizing unresolved, very low mass spectral blend binaries composed of late-M, L, and T dwarfs using machine learning methodologies. We generated and evaluated a series of hierarchical random…

We study the tandem duplication distance between binary sequences and their roots. In other words, the quantity of interest is the number of tandem duplication operations of the form $\seq x = \seq a \seq b \seq c \to \seq y = \seq a \seq b…

The length function $\ell_2(r,R)$ is the smallest length of a binary linear code with codimension (redundancy) $r$ and covering radius $R$. We obtain the following new upper bounds on $\ell_2(r,R)$, which yield a decrease $\Delta(r,R)$…

In this paper, we present a method for estimating the least common multiple of a large class of binary linear recurrence sequences. Let $P,Q,R_0$, and $R_1$ be fixed integers and let $\boldsymbol{R}=\left(R_n\right)_{n}$ be the recurrence…

Given a graph $F$, a graph $G$ is weakly $F$-saturated if all non-edges of $G$ can be added in some order so that each new edge introduces a copy of $F$. The weak saturation number $\operatorname{wsat}(n, F)$ is the minimum number of edges…

We consider the problem of exact recovery of a $k$-sparse binary vector from generalized linear measurements (such as logistic regression). We analyze the linear estimation algorithm (Plan, Vershynin, Yudovina, 2017), and also show…

In this work, we construct the first locally-correctable codes (LCCs), and locally-testable codes (LTCs) with constant rate, constant relative distance, and sub-polynomial query complexity. Specifically, we show that there exist binary LCCs…

Locally recoverable (LRC) codes have recently been a focus point of research in coding theory due to their theoretical appeal and applications in distributed storage systems. In an LRC code, any erased symbol of a codeword can be recovered…

We consider binary continuous phase modulation (CPM) signals used in some recent low-cost and low-power consumption telecommunications standard. When these signals are generated through a low-cost transmitter, the real modulation index can…

Minimum Bayes Risk (MBR) decoding is a powerful decoding strategy widely used for text generation tasks, but its quadratic computational complexity limits its practical application. This paper presents a novel approach for approximating MBR…

The paper presents bounds on the achievable rates and the decoding complexity of low-density parity-check (LDPC) codes. It is assumed that the communication of these codes takes place over statistically independent parallel channels where…

This paper studies properties of binary runlength-limited sequences with additional constraints on their Hamming weight and/or their number of runs of identical symbols. An algebraic and a probabilistic (entropic) characterization of the…

Polarization-adjusted convolutional (PAC) codes can approach the theoretical bound for block error rate (BLER) performance at short-to-medium codeword length. PAC codes have excellent BLER performance using Monte Carlo (MC) rate-profiles…

We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the…

General analytic energy bounds are derived for N-boson systems governed by semirelativistic Hamiltonians of the form H=\sum_{i=1}^N \sqrt(p_i^2+m^2) + \sum_{1=i<j}^N V(r_{ij}), where V(r) is a static attractive pair potential. A…