Related papers: First- and Second-Order Coding Theorems for Mixed …
In this paper we study quantum communication channels with correlated noise effects, i.e., quantum channels with memory. We derive a model for correlated noise channels that includes a channel memory state. We examine the case where the…
The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case.…
We present a constraint-coding scheme to correct asymmetric magnitude-$1$ errors in multi-level non-volatile memories. For large numbers of such errors, the scheme is shown to deliver better correction capability compared to known…
In this work, we examine cognitive radio networks, where secondary users may act as relays for messages sent by the primary user, hence offering performance improvement of primary transmissions, while at the same time obtaining more…
We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by…
Partial ordering of communication channels has applications in performance analysis, and goes beyond comparisons of channels just on the basis of their Shannon capacity or error probability. Shannon defined a partial order of channel…
This paper studies several problems concerning channel inclusion, which is a partial ordering between discrete memoryless channels (DMCs) proposed by Shannon. Specifically, majorization-based conditions are derived for channel inclusion…
We consider communication over memoryless channels using low-density parity-check code ensembles above the iterative (belief propagation) threshold. What is the computational complexity of decoding (i.e., of reconstructing all the typical…
This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class…
We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by…
We consider the distributed channel access problem for a system consisting of multiple control subsystems that close their loop over a shared wireless network. We propose a distributed method for providing deterministic channel access…
We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes our method exploits…
We consider upper bounds on the error probability in channel coding. We derive an improved maximum-likelihood union bound, which takes into account events where the likelihood of the correct codeword is tied with that of some competitors.…
The filtering-clustering models, including trend filtering and convex clustering, have become an important source of ideas and modeling tools in machine learning and related fields. The statistical guarantee of optimal solutions in these…
This paper is concerned with general interference channels characterized by a sequence of transition (conditional) probabilities. We present a general formula for the capacity region of the interference channel with two pairs of users. The…
Reed-Muller (RM) codes have undergone significant analytical advancements over the past decade, particularly for binary memoryless symmetric (BMS) channels. We extend the scope of RM codes development and analysis to multiple-access…
The paper considers coding schemes derived from Reed-Muller (RM) codes, for transmission over input-constrained memoryless channels. Our focus is on the $(d,\infty)$-runlength limited (RLL) constraint, which mandates that any pair of…
The paper presents bounds on the achievable rates and the decoding complexity of low-density parity-check (LDPC) codes. It is assumed that the communication of these codes takes place over statistically independent parallel channels where…
A central question in information theory is to determine the maximum success probability that can be achieved in sending a fixed number of messages over a noisy channel. This was first studied in the pioneering work of Shannon who…
While there are continuous efforts to introduce new communication systems and standards, it is legitimate to ask the question: how can one send additional bits by minimally changing the systems that are already operating? This is of a…