24,493 research outputs found
The Three-User Finite-Field Multi-Way Relay Channel with Correlated Sources
This paper studies the three-user finite-field multi-way relay channel, where
the users exchange messages via a relay. The messages are arbitrarily
correlated, and the finite-field channel is linear and is subject to additive
noise of arbitrary distribution. The problem is to determine the minimum
achievable source-channel rate, defined as channel uses per source symbol
needed for reliable communication. We combine Slepian-Wolf source coding and
functional-decode-forward channel coding to obtain the solution for two classes
of source and channel combinations. Furthermore, for correlated sources that
have their common information equal their mutual information, we propose a new
coding scheme to achieve the minimum source-channel rate.Comment: Author's final version (accepted and to appear in IEEE Transactions
on Communications
An Achievable Rate Region for the Broadcast Channel with Feedback
A single-letter achievable rate region is proposed for the two-receiver
discrete memoryless broadcast channel with generalized feedback. The coding
strategy involves block-Markov superposition coding, using Marton's coding
scheme for the broadcast channel without feedback as the starting point. If the
message rates in the Marton scheme are too high to be decoded at the end of a
block, each receiver is left with a list of messages compatible with its
output. Resolution information is sent in the following block to enable each
receiver to resolve its list. The key observation is that the resolution
information of the first receiver is correlated with that of the second. This
correlated information is efficiently transmitted via joint source-channel
coding, using ideas similar to the Han-Costa coding scheme. Using the result,
we obtain an achievable rate region for the stochastically degraded AWGN
broadcast channel with noisy feedback from only one receiver. It is shown that
this region is strictly larger than the no-feedback capacity region.Comment: To appear in IEEE Transactions on Information Theory. Contains
example of AWGN Broadcast Channel with noisy feedbac
Strongly Secure Communications Over the Two-Way Wiretap Channel
We consider the problem of secure communications over the two-way wiretap
channel under a strong secrecy criterion. We improve existing results by
developing an achievable region based on strategies that exploit both the
interference at the eavesdropper's terminal and cooperation between legitimate
users. We leverage the notion of channel resolvability for the multiple-access
channel to analyze cooperative jamming and we show that the artificial noise
created by cooperative jamming induces a source of common randomness that can
be used for secret-key agreement. We illustrate the gain provided by this
coding technique in the case of the Gaussian two-way wiretap channel, and we
show significant improvements for some channel configurations.Comment: 11 pages, 7 figures, submitted to IEEE Transactions on Information
Forensics and Security, Special Issue: "Using the Physical Layer for Securing
the Next Generation of Communication Systems
On feedback in network source coding
We consider source coding over networks with
unlimited feedback from the sinks to the sources. We first show
examples of networks where the rate region with feedback is
a strict superset of that without feedback. Next, we find an
achievable region for multiterminal lossy source coding with
feedback. Finally, we evaluate this region for the case when one
of the sources is fully known at the decoder and use the result
to show that this region is a strict superset of the best known
achievable region for the problem without feedback
The Finite Field Multi-Way Relay Channel with Correlated Sources: The Three-User Case
The three-user finite field multi-way relay channel with correlated sources
is considered. The three users generate possibly correlated messages, and each
user is to transmit its message to the two other users reliably in the Shannon
sense. As there is no direct link among the users, communication is carried out
via a relay, and the link from the users to the relay and those from the relay
to the users are finite field adder channels with additive noise of arbitrary
distribution. The problem is to determine the set of all possible achievable
rates, defined as channel uses per source symbol for reliable communication.
For two classes of source/channel combinations, the solution is obtained using
Slepian-Wolf source coding combined with functional-decode-forward channel
coding.Comment: to be presented at ISIT 201
- …