Related papers: Low Autocorrelation Binary Sequences: Number Theor…
The low temperature correlation length and the static structure factor are computed for bilayer antiferromagnets such as YBa_2Cu_3O_6. It is shown that energy integrated two-axis scan in neutron scattering experiments can be meaningfully…
Minimum Bayes Risk (MBR) decoding has seen renewed interest as an alternative to traditional generation strategies. While MBR has proven effective in machine translation, where the variability of a language model's outcome space is…
A repetition free Longest Common Subsequence (LCS) of two sequences x and y is an LCS of x and y where each symbol may appear at most once. Let R denote the length of a repetition free LCS of two sequences of n symbols each one chosen…
Laplace learning is a popular machine learning algorithm for finding missing labels from a small number of labelled feature vectors using the geometry of a graph. More precisely, Laplace learning is based on minimising a graph-Dirichlet…
We propose and practically demonstrate a joint detection and decoding scheme for short-packet wireless communications in scenarios that require to first detect the presence of a message before actually decoding it. For this, we extend the…
Coded recurrent neural networks with three levels of sparsity are introduced. The first level is related to the size of messages, much smaller than the number of available neurons. The second one is provided by a particular coding rule,…
We study the lowest energy E of a semirelativistic system of N identical massless bosons with Hamiltonian H= sum{i=1 to N} sqrt(p_i^2)+ sum{j>i=1 to N} g |r_i - r_j|^2, g > 0. We prove the inequalities A [g N^2 (N-1)^2]^{1/3} < E < B [g N^2…
Some emerging 5G and beyond use-cases impose stringent latency constraints, which necessitates a paradigm shift towards finite blocklength performance analysis. In contrast to Shannon capacity-achieving codes, the codeword length in the…
It has been noticed that all the known binary sequences having the asymptotic merit factor $\ge 6$ are the modifications to the real primitive characters. In this paper, we give a new modification of the character sequences at length…
Eclipsing binaries (EBs) play an important astrophysical role in studying stellar properties and evolution. By analyzing photometric data in the LAMOST Medium-Resolution Survey field, RA: $23^h$$01^m$$51.00^s$, Dec:…
Minimum distance is an important parameter of a linear error correcting code. For improved performance of binary Low Density Parity Check (LDPC) codes, we need to have the minimum distance grow fast with n, the codelength. However, the best…
In radar sensing and communications, designing Doppler resilient sequences (DRSs) with low ambiguity function for delay over the entire signal duration and Doppler shift over the entire signal bandwidth is an extremely difficult task.…
The blazar sequence, including negative correlations between radiative luminosity $L_{\rm rad}$ and synchrotron peak frequency $\nu$, and between Compton dominance $Y$ and $\nu$, is widely adopted as a phenomenological description of…
The photometric and spectroscopic studies of six contact binaries were performed for the first time. The orbital periods of all the six targets are longer than 0.5d, and we discovered that their mass ratios are smaller than 0.15. So, they…
New bounds on classification error rates for the error-correcting output code (ECOC) approach in machine learning are presented. These bounds have exponential decay complexity with respect to codeword length and theoretically validate the…
Let $W$ be a binary-input memoryless symmetric (BMS) channel with Shannon capacity $I(W)$ and fix any $\alpha > 0$. We construct, for any sufficiently small $\delta > 0$, binary linear codes of block length $O(1/\delta^{2+\alpha})$ and rate…
We consider the problem of making a quick decision in favor of one of two possible physical signal models while the numerical measurements are acquired by sensing devices featuring minimal digitization complexity. Therefore, the digital…
We present a general approach to the problem of determining tight asymptotic lower bounds for generalized central moments of the optimal alignment score of two independent sequences of i.i.d. random variables. At first, these are obtained…
We use a combination of perturbation theory, holography, supersymmetric localization, integrability, and numerical conformal bootstrap methods to constrain the energy-energy correlator in $\text{SU}(N_c)$ ${\mathcal N}=4$ SYM at finite…
This paper examines linear binary codes capable of correcting one or more errors. For the single-error-correcting case, it is shown that the Hamming bound is achieved by a constructive method, and an exact expression for the minimal…