Related papers: MAC Resolvability: First And Second Order Results
This letter focuses on exploring a new decoding order to resolve the secrecy issue among untrusted nonorthogonal multiple access users. In this context, firstly, we identify the total number of possible decoding orders analytically. Then,…
This paper studies the value of limited rate cooperation between the transmitters for managing interference and simultaneously ensuring secrecy, in the 2-user Gaussian symmetric interference channel (GSIC). First, the problem is studied in…
"Unidirectional channel systems" (Chambart & Schnoebelen, CONCUR 2008) are finite-state systems where one-way communication from a Sender to a Receiver goes via one reliable and one unreliable unbounded fifo channel. While reachability is…
Several gaps and errors in [1] are identified and corrected. While accommodating these corrections, a rigours proof is given that the successive convex approximation algorithm in [1] for secrecy rate maximization (SRM) does generate an…
A critically important component of most signal processing procedures is that of computing the distance between signals. In multi-party processing applications where these signals belong to different parties, this introduces privacy…
The problem of reliable communication over the multiple-access channel (MAC) with states is investigated. We propose a new coding scheme for this problem which uses quasi-group codes (QGC). We derive a new computable single-letter…
For a singular and symmetric discrete memoryless channel with positive dispersion, the third-order term in the normal approximation is shown to be upper bounded by a constant. This finding completes the characterization of the third-order…
We consider a two user multiple-access channel with an eavesdropper at the receiving end. We use previously transmitted messages as a key in the next slot till we achieve the capacity region of the usual Multiple Access Channel (MAC).
We study quantum soft covering and privacy amplification against quantum side information. The former task aims to approximate a quantum state by sampling from a prior distribution and querying a quantum channel. The latter task aims to…
We consider the problem of cross-layer resource allocation in time-varying cellular wireless networks, and incorporate information theoretic secrecy as a Quality of Service constraint. Specifically, each node in the network injects two…
Linearisability is a central notion for verifying concurrent libraries: a given library is proven safe if its operational history can be rearranged into a new sequential one which, in addition, satisfies a given specification.…
The fading cognitive multiple-access channel with confidential messages (CMAC-CM) is investigated, in which two users attempt to transmit common information to a destination and user 1 also has confidential information intended for the…
We consider the problem of multiple description scalar quantizers and describing the achievable rate-distortion tuples in that setting. We formulate it as a combinatorial optimization problem of arranging numbers in a matrix to minimize the…
Second-order coding rate of channel coding is discussed for general sequence of channels. The optimum second-order transmission rate with a constant error constraint $\epsilon$ is obtained by using the information spectrum method. We apply…
This article examines the problem of state estimation over multi-terminal channels in an unreliable regime. More specifically, we consider two canonical settings. In the first setting, measurements of a common stochastic source need to be…
Our original results refer to multivariate recurrences: discrete multitime diagonal recurrence, bivariate recurrence, trivariate recurrence, solutions tailored to particular situations, second order multivariate recurrences, characteristic…
The secrecy performance of a source-channel model is studied in the context of lossy source compression over a noisy broadcast channel. The source is causally revealed to the eavesdropper during decoding. The fidelity of the transmission to…
The multiple access channel (MAC) capacity with feedback is considered under feedback models designed to tease out which factors contribute to the MAC feedback capacity benefit. Comparing the capacity of a MAC with ``perfect'' feedback,…
Fundamentally, every static program analyser searches for a proof through a combination of heuristics providing candidate solutions and a candidate validation technique. Essentially, the heuristic reduces a second-order problem to a…
In this article, we take a closer look at the reliability of large minimal networks constructed by repeated compositions of the simplest possible networks. For a given number of devices $n=2^m$ we define the set of all the possible…