Related papers: Binary Proportional Pairing Functions

Boolean functions can be used to construct binary linear codes in many ways, and vice versa. The objective of this short article is to point out a connection between the weight distributions of all projective binary linear codes and the…

We give a new simple construction for known binary quadratic symmetric bent and almost bent functions. In particular, for even number of variables, they are self-dual and anti-self-dual quadratic bent functions, respectively, which are not…

Binary embedding is the problem of mapping points from a high-dimensional space to a Hamming cube in lower dimension while preserving pairwise distances. An efficient way to accomplish this is to make use of fast embedding techniques…

A function between two metric spaces is said to be totally bounded regular if it preserves totally bounded sets. These functions need not be continuous in general. Hence the purpose of this article is to study such functions vis-\'a-vis…

An integer adder for integers in the binary representation is one of the basic operations of any digital processor. For adding two integers of N bits each, the serial adder takes as many clock ticks. For achieving higher speeds, parallel…

Incomplete binary mixing of two components can form a heterogeneous assemblage in space. The heterogeneity power spectrum of the assemblage can be frequently obtained. However, it is unknown if a stochastic binary field exists to generate…

A binary shuffle square is a binary word of even length that can be partitioned into two disjoint, identical subwords. Huang, Nam, Thaper, and the first author conjectured that as $n\rightarrow \infty$, asymptotically half of all binary…

Pairwise learning or dyadic prediction concerns the prediction of properties for pairs of objects. It can be seen as an umbrella covering various machine learning problems such as matrix completion, collaborative filtering, multi-task…

Probability predictions from binary regressions or machine learning methods ought to be calibrated: If an event is predicted to occur with probability $x$, it should materialize with approximately that frequency, which means that the…

Let X be a non-empty set and U a ring of subsets of X. The countable additive functions U->{0,1} are called measures. The paper gives some definitions (derivable measures, the Lebesgue-Stieltjes measures) and properties of these functions,…

A complete solution describing a binary system constituted by two unequal counter-rotating black holes with a massless strut inbetween is presented. It is expressed in terms of four arbitrary parameters: the half length of the two rods…

Code decompositions (a.k.a code nestings) are used to design good binary polar code kernels. The proposed kernels are in general non-linear and show a better rate of polarization under successive cancelation decoding, than the ones…

Unconstrained binary integer programming (UBIP) poses significant computational challenges due to its discrete nature. We introduce a novel reformulation approach using a piecewise cubic function that transforms binary constraints into…

The optimal binning is the optimal discretization of a variable into bins given a discrete or continuous numeric target. We present a rigorous and extensible mathematical programming formulation for solving the optimal binning problem for a…

We study a new generalized version of the point pair function defined with a constant $\alpha>0$. We prove that this function is a quasi-metric for all values of $\alpha>0$, and compare it to several hyperbolic-type metrics, such as the…

A rectangle blanket is a set of non-overlapping axis-aligned rectangles, used to approximately represent the two dimensional image of a shape approximately. The use of a rectangle blanket is a widely considered strategy for speeding-up the…

We describe an algorithm for computing the inner product between a holomorphic modular form and a unary theta function, in order to determine whether the form is orthogonal to unary theta functions without needing a basis of the entire…

There are considered isometries on a Hilbert space. By the Wold theorem any isometry can be decomposed into a unitary operator and a unilateral shift. For a pair of isometries, even commuting, a maximal subspace reducing one isometry to a…

This paper describes a new and purely functional implementation technique of binary heaps. A binary heap is a tree-based data structure that implements priority queue operations (insert, remove, minimum/maximum) and guarantees at worst…

We consider functions mapping non-negative integers to non-negative real numbers such that a and a+n are mapped to values at least 1/n apart. In this paper we use a novel method to construct such a function. We conjecture that the supremum…