相关论文: Zero-Error Sum Modulo Two with a Common Observatio…
This paper considers two generalizations of the cooperative data exchange problem, referred to as the successive local omniscience (SLO) and the successive global omniscience (SGO). The users are divided into $\ell$ nested sub-groups. Each…
We study a fading linear finite-field relay network having multiple source-destination pairs. Because of the interference created by different unicast sessions, the problem of finding its capacity region is in general difficult. We observe…
A binary linear error correcting codes represented by two code families Kronecker products sum are considered. The dimension and distance of new code is investigated. Upper and lower bounds of distance are obtained. Some examples are given.…
Using linear functional-based duality of modules, we generalize the syndrome decoding algorithm of linear codes over finite fields to those over finite commutative rings. Moreover, If the ring is local the algorithm is simplified by…
An $R$-module $V$ over a semiring $R$ lacks zero sums (LZS) if $ x +y = 0 \; \Rightarrow \; x = y = 0$. More generally, asubmodule $W$ of $V$ is "summand absorbing", if $ \forall \, x, y \in V: \ x + y \in W \; \Rightarrow \; x \in W, \; y…
We study the redundancy of universally compressing strings $X_1,\dots, X_n$ generated by a binary Markov source $p$ without any bound on the memory. To better understand the connection between compression and estimation in the Markov…
In this paper we study summability based on double sequences of complex constants as it is defined in "Linear Operators, General Theory" by N. Dunford and J. T. Schwartz. We define "power double sequences" or infinite "power matrices" as…
This paper introduces a checksum algorithm that provides a new point in the performance/complexity/effectiveness checksum tradeoff space. It has better fault detection properties than single-sum and dual-sum modular addition checksums. It…
It has been well-known that for two-way contingency tables with fixed row sums and column sums the set of square-free moves of degree two forms a Markov basis. However when we impose an additional constraint that the sum of a subtable is…
The Monte Carlo shell model is a powerful technique for computational nuclear structure. Only a certain class of nuclear interactions, however, such as pairing and quadrupole, are free of the numerical noise known as the sign problem.This…
Numerous methods have been considered to create a fast integer factorization algorithm. Despite its apparent simplicity, the difficulty to find such an algorithm plays a crucial role in modern cryptography, notably, in the security of RSA…
A counter-example to lower bounds for the singular values of the sum of two matrices in [1] and [2] is given. Correct forms of the bounds are pointed out.
Let $p$ be an odd prime, and let $a$ be a rational $p$-adic integer with $a\not\equiv 0\pmod p$. In this paper, using WZ method we establish the congruences for $\sum_{k=0}^{p-1} \binom ak^2(-1)^k(1-\frac 2ak)$ modulo $p^2$ and…
We show that for any mod $2^m$ characters, $\chi_1, \chi_2,$ the complete exponential sum, $$ \sum_{x=1}^{2^m}\chi_1(x) \chi_2(Ax^k+B), $$ has a simple explicit evaluation.
We show a simple method for constructing larger matrices but preserving the spectral radius. This yields a sufficient criteria for two square matrices of arbitrary dimension have the same spectral radius, a way to compare spectral radii of…
Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…
We obtain a new bound for incomplete Gauss sums modulo primes. Our argument falls under the framework of Vinogradov's method which we use to reduce the problem under consideration to bounding the number of solutions to two distinct systems…
We study the problem of synthesising a two-user broadcast channel using a common message, where each output terminal shares an independent source of randomness with the input terminal. This generalises two problems studied in the literature…
In his groundbreaking work on pair correlation, Montgomery analyzed the distribution of the differences $\gamma'-\gamma$ between ordinates $\gamma$ of the nontrivial zeros of the Riemann zeta function, assuming the Riemann Hypothesis. In…
We address the observability problem for ensembles that are described by probability distributions. The problem is to reconstruct a probability distribution of the initial state from the time-evolution of the probability distribution of the…