Related papers: Threshold Decoding for Disjunctive Group Testing
We study collective dynamics of complex networks of stochastic excitable elements, active rotators. In the thermodynamic limit of infinite number of elements, we apply a mean-field theory for the network and then use a Gaussian…
When the environmental disturbace to a quantum system has a wavelength much larger than the system size, all qubits localized within a small area are under action of the same error operators. Noiseless subsystem and decoherence free…
A binary matrix is called an s-separable code for the disjunctive multiple-access channel (disj-MAC) if Boolean sums of sets of s columns are all distinct. The well-known issue of the combinatorial coding theory is to obtain upper and lower…
The motivation for this paper comes from the ongoing SARS-CoV-2 Pandemic. Its goal is to present a previously neglected approach to non-adaptive group testing and describes it in terms of residuated pairs on partially ordered sets. Our…
The color code has been invaluable for the development of the theory of fault-tolerant logic gates using transversal rotations. Three-dimensional examples of the color code have shown us how its structure, specifically the intersection of…
Coupling of cluster and deformed structures are important for dynamics of nuclear structure. Threshold energy has been discussed to explain cluster structures coupling to deformed states but relation between threshold energy and excitation…
We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…
Let $s(n)$ denote the number of ones in the binary expansion of the nonnegative integer $n$. How does $s$ behave under addition of a constant $t$? In order to study the differences \[s(n+t)-s(n),\] for all $n\ge0$, we consider the…
In this paper, we propose an efficient two-stage decoding algorithm for non-adaptive Group Testing (GT) with general correlated prior statistics. The proposed solution can be applied to any correlated statistical prior represented in…
In open quantum systems with strong symmetries, the global scaled cumulant generating function (SCGF) is generally nonanalytic, so the G\"artner-Ellis theorem cannot directly yield the genuine large-deviation rate function. To address this…
We consider transmission over a general memoryless channel, with bounded decoding complexity per bit under message passing decoding. We show that the achievable rate is bounded below capacity if there is a finite success in the decoding in…
Inspired by recent results from collusion-resistant traitor tracing, we provide a framework for constructing efficient probabilistic group testing schemes. In the traditional group testing model, our scheme asymptotically requires T ~ 2 K…
We consider a communication problem in which the receiver must first detect the presence of an information packet and, if detected, decode the message carried within it. We present general nonasymptotic upper and lower bounds on the maximum…
In this paper, we investigate computational power of threshold circuits and other theoretical models of neural networks in terms of the following four complexity measures: size (the number of gates), depth, weight and energy. Here the…
A fundamental characteristic of excitable systems is their ability to exhibit distinct subthreshold and suprathreshold behaviors. Precisely quantifying this distinction requires a proper definition of the threshold, which has remained…
The decoding error probability of codes is studied as a function of their block length. It is shown that the existence of codes with a polynomially small decoding error probability implies the existence of codes with an exponentially small…
We investigate adaptive single-trial error/erasure decoding of binary codes whose decoder is able to correct e errors and t erasures if le+t<=d-1. Thereby, d is the minimum Hamming distance of the code and 1<l<=2 is the tradeoff parameter…
For a quantum error correcting code to be used in practice, it needs to be equipped with an efficient decoding algorithm, which identifies corrections given the observed syndrome of errors.Hypergraph product codes are a promising family of…
Given $p$ samples, each of which may or may not be defective, group testing (GT) aims to determine their defect status by performing tests on $n < p$ `groups', where a group is formed by mixing a subset of the $p$ samples. Assuming that the…
A signed graph $(G,\Sigma)$ is a graph $G$ together with a set $\Sigma \subseteq E(G)$ of negative edges. A circuit is positive if the product of the signs of its edges is positive. A signed graph $(G,\Sigma)$ is balanced if all its…