相关论文: Zero-Error Sum Modulo Two with a Common Observatio…

This paper addresses the problem of coding a continuous random source correlated with another source which is only available at the decoder. The proposed approach is based on the extension of the channel coding concept of syndrome from the…

The error exponent in lossy source coding characterizes the asymptotic decay rate of error probability with respect to blocklength. The Marton's error exponent provides the theoretically optimal bound on this rate. However, computation…

We consider the problem of zero error source coding with limited feedback when side information is present at the receiver. First, we derive an achievable rate region for arbitrary joint distributions on the source and the side information.…

We study in this paper a generalized coupon collector problem, which consists in determining the distribution and the moments of the time needed to collect a given number of distinct coupons that are drawn from a set of coupons with an…

We consider the problem of extracting randomness from \textit{sumset sources}, a general class of weak sources introduced by Chattopadhyay and Li (STOC, 2016). An $(n,k,C)$-sumset source $\mathbf{X}$ is a distribution on $\{0,1\}^n$ of the…

Let $R$ be a ring, and consider a left $R$-module given with two (generally infinite) direct sum decompositions, $A\oplus(\bigoplus_{i\in I} C_i)=M=B\oplus(\bigoplus_{j\in J} D_j),$ such that the submodules $A$ and $B$ and the $D_j$ are…

The Index Conjecture in zero-sum theory states that when $n$ is coprime to $6$ and $k$ equals $4$, every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While other values of $(k,n)$ have been studied thoroughly in the…

This paper presents a one shot analysis of the lossy compression problem under average distortion constraints. We calculate the exact expected distortion of a random code. The result is given as an integral formula using a newly defined…

For any positive integers l and m, a set of integers is said to be (weakly) l-sum-free modulo m if it contains no (pairwise distinct) elements $x_1,x_2,...,x_l,y$ satisfying the congruence $x_1+\...+x_l\equiv y\bmod{m}$. It is proved that,…

Sum-rank-metric codes have wide applications in universal error correction, multishot network coding, space-time coding and the construction of partial-MDS codes for repair in distributed storage. Fundamental properties of sum-rank-metric…

To reduce computational complexity and delay in randomized network coded content distribution (and for some other practical reasons), coding is not performed simultaneously over all content blocks but over much smaller subsets known as…

Through the present paper, the code gamgamZZ is presented, which may be used to calculate all possible observables related to the process $\gamma \gamma \to ZZ$, in either the Standard Model (SM), or the minimal sypersymmetric standard…

Massless modes of both heterotic and Type II string compactifications on compact manifolds are determined by vector bundle valued cohomology classes. Various applications of our recent algorithm for the computation of line bundle valued…

In this paper, we consider sums of class numbers of the type $\sum_{m\equiv a\pmod{p}} H(4n-m^2)$, where $p$ is an odd prime, $n\in \mathbb{N},$ and $a\in \mathbb{Z}$. By showing that these are coefficients of mixed mock modular forms, we…

We consider a directed acyclic network with three sources and three terminals such that each source independently generates one symbol from a given field $F$ and each terminal wants to receive the sum (over $F$) of the source symbols. Each…

Let $x_{1},x_{2},\ldots,x_{n}$ be $n$ numbers, and $y_{1},y_{2},\ldots,y_{n}$ be $n$ further numbers chosen such that all $n^{2}$ pairwise sums $x_{i}+y_{j}$ are nonzero. Consider the $n\times n$-matrix \[ C:=\left(…

It is an experimental design problem in which there are two Poisson sources with two possible and known rates, and one counter. Through a switch, the counter can observe the sources individually or the counts can be combined so that the…

In this paper, we formally introduce the concept of a row-sum matrix over an arbitrary group $G$. When $G$ is cyclic, these types of matrices have been widely used to build uniform 2-factorizations of small Cayley graphs (or, Cayley…

Secure multi-party computation is a central problem in modern cryptography. An important sub-class of this are problems of the following form: Alice and Bob desire to produce sample(s) of a pair of jointly distributed random variables. Each…

Under Markovian assumptions, we leverage a Central Limit Theorem (CLT) for the empirical measure in the test statistic of the composite hypothesis Hoeffding test so as to establish weak convergence results for the test statistic, and,…