The Capacity Region of Restricted Multi-Way Relay Channels with Deterministic Uplinks

This paper considers the multi-way relay channel (MWRC) where multiple users exchange messages via a single relay. The capacity region is derived for a special class of MWRCs where (i) the uplink and the downlink are separated in the sense that there is no direct user-to-user links, (ii) the channel is restricted in the sense that each user's transmitted channel symbols can depend on only its own message, but not on its received channel symbols, and (iii) the uplink is any deterministic function.Comment: Author's final version (to be presented at ISIT 2012

The Capacity Region of the Restricted Two-Way Relay Channel with Any Deterministic Uplink

This paper considers the two-way relay channel (TWRC) where two users communicate via a relay. For the restricted TWRC where the uplink from the users to the relay is any deterministic function and the downlink from the relay to the users is any arbitrary channel, the capacity region is obtained. The TWRC considered is restricted in the sense that each user can only transmit a function of its message.Comment: author's final version (accepted and to appear in IEEE Communications Letters

Effects of Temperature and Crowding on the Pathogenicity of Edwardsiella ictaluri in Channel Catfish (Ictalurus punctatus)

Channel catfish were injected with Edwardsiella ictaluri and stocked at increasing temperatures and densities. Bacteriological examination of kidney, liver and spleen revealed the greatest numbers of organisms in fish from the highest temperature and stocking density tested. Survival time was the shortest for fish held at the highest temperature and stocking density. Increased temperature and crowding were directly proportional to the number of organisms recovered from the organs and inversely proportional to fish survival time

Theory, manufacture and performance of holographic X-ray gratings

Imperial Users onl

Optimal Coding Schemes for the Three-Receiver AWGN Broadcast Channel with Receiver Message Side Information

This paper investigates the capacity region of the three-receiver AWGN broadcast channel where the receivers (i) have private-message requests and (ii) may know some of the messages requested by other receivers as side information. We first classify all 64 possible side information configurations into eight groups, each consisting of eight members. We next construct transmission schemes, and derive new inner and outer bounds for the groups. This establishes the capacity region for 52 out of 64 possible side information configurations. For six groups (i.e., groups 1, 2, 3, 5, 6, and 8 in our terminology), we establish the capacity region for all their members, and show that it tightens both the best known inner and outer bounds. For group 4, our inner and outer bounds tighten the best known inner bound and/or outer bound for all the group members. Moreover, our bounds coincide at certain regions, which can be characterized by two thresholds. For group 7, our inner and outer bounds coincide for four members, thereby establishing the capacity region. For the remaining four members, our bounds tighten both the best known inner and outer bounds.Comment: Authors' final version (to appear in IEEE Transactions on Information Theory

A Unified Scheme for Two-Receiver Broadcast Channels with Receiver Message Side Information

This paper investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side information. We first propose a transmission scheme and derive an inner bound for the two-receiver memoryless broadcast channel. We next prove that this inner bound is tight for the deterministic channel and the more capable channel, thereby establishing their capacity regions. We show that this inner bound is also tight for all classes of two-receiver broadcast channels whose capacity regions were known prior to this work. Our proposed scheme is consequently a unified capacity-achieving scheme for these classes of broadcast channels.Comment: accepted and to be presented at the 2015 IEEE International Symposium on Information Theory (ISIT 2015

The Capacity of Three-Receiver AWGN Broadcast Channels with Receiver Message Side Information

This paper investigates the capacity region of three-receiver AWGN broadcast channels where the receivers (i) have private-message requests and (ii) know the messages requested by some other receivers as side information. We classify these channels based on their side information into eight groups, and construct different transmission schemes for the groups. For six groups, we characterize the capacity region, and show that it improves both the best known inner and outer bounds. For the remaining two groups, we improve the best known inner bound by using side information during channel decoding at the receivers.Comment: This is an extended version of the same-titled paper submitted to IEEE International Symposium on Information Theory (ISIT) 201