Related papers: Constrained Codes for Rank Modulation
We show that in a knapsack feasibility problem an integral vector $p$, which is short, and near parallel to the constraint vector gives a branching direction with small integer width. We use this result to analyze two computationally…
A long-standing open question in Integer Programming is whether integer programs with constraint matrices with bounded subdeterminants are efficiently solvable. An important special case thereof are congruency-constrained integer programs…
Massive neutrinos suppress the growth of structure below their free-streaming scale and leave an imprint on large-scale structure. Measuring this imprint allows us to constrain the sum of neutrino masses, $M_\nu$, a key parameter in…
Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), encode messages $s$ in a manner so that tampering the codeword causes the decoder to either output $s$ or a message that is independent of $s$. While this is an…
Let $\mathcal D_n$ denote the average number of iterations of West's stack-sorting map $s$ that are needed to sort a permutation in $S_n$ into the identity permutation $123\cdots n$. We prove that…
For N=1,2,..., let S_N be a simple random sample of size n=n_N from a population A_N of size N, where 0<=n<=N. Then with f_N=n/N, the sampling fraction, and 1_A the inclusion indicator that A is in S_N, for any H a subset of A_N of size k>=…
We obtain results related to boundedness of the growth of Fourier transform by the modulus of continuity on Damek-Ricci spaces. For noncompact riemannian symmetric spaces of rank one, analogues of all the results follow the same way.
We investigate from a computational perspective the efficiency of the Willshaw synaptic update rule in the context of familiarity discrimination, a binary-answer, memory-related task that has been linked through psychophysical experiments…
We introduce the notion of a weighted inversion statistic on the symmetric group, and examine its distribution on each conjugacy class. Our work generalizes the study of several common permutation statistics, including the number of…
Let $X=X(n,q)$ be the set of $n\times n$ Hermitian matrices over $\mathbb{F}_{q^2}$. It is well known that $X$ gives rise to a metric translation association scheme whose classes are induced by the rank metric. We study $d$-codes in this…
The pivotal storage density win achieved by solid-state devices over magnetic devices recently is a result of multiple innovations in physics, architecture, and signal processing. Constrained coding is used in Flash devices to increase…
We investigate lossy compression (source coding) of data in the form of permutations. This problem has direct applications in the storage of ordinal data or rankings, and in the analysis of sorting algorithms. We analyze the rate-distortion…
The capacity achieving probability mass function (PMF) of a finite signal constellation with an average power constraint is in most cases non-uniform. A common approach to generate non-uniform input PMFs is Huffman shaping, which consists…
We take the testing perspective to understand what the minimal discrimination time between two stimuli is for different types of rate coding neurons. Our main goal is to describe the testing abilities of two different encoding systems:…
This article is devoted to the problem of predicting the value taken by a random permutation $\Sigma$, describing the preferences of an individual over a set of numbered items $\{1,\; \ldots,\; n\}$ say, based on the observation of an…
Constrained coding plays a key role in optimizing performance and mitigating errors in applications such as storage and communication, where specific constraints on codewords are required. While non-parametric constraints have been…
Let $S_n$ denote the set of permutations of $[n]:=\{1,\cdots, n\}$, and denote a permutation $\sigma\in S_n$ by $\sigma=\sigma_1\sigma_2\cdots \sigma_n$. For $l\ge2$ an integer, let $A^{(n)}_{l;k}\subset S_n$ denote the event that the set…
In [S. Kitaev and J. Remmel: Classifying descents according to parity] the authors refine the well-known permutation statistic "descent" by fixing parity of (exactly) one of the descent's numbers. In this paper, we generalize the results of…
We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…
The rank problem in succinct data structures asks to preprocess an array A[1..n] of bits into a data structure using as close to n bits as possible, and answer queries of the form rank(k) = Sum_{i=1}^k A[i]. The problem has been intensely…