Hierarchical Cache-Aided Networks for Linear Function Retrieval.

In a hierarchical caching system, a server is connected to multiple mirrors, each of which is connected to a different set of users, and both the mirrors and the users are equipped with caching memories. All the existing schemes focus on single file retrieval, i.e.

New Bounds on Capacity Region of Multiple Access Channels in Visible Light Communications.

In this paper, we propose new inner and outer bounds of the capacity region for multiple access channels in visible light communication (VLC) networks under both peak and average optical power constraints. Specifically, the proposed inner bounds are established by employing the single-user capacity achieving input distribution for each user. The proposed outer bounds are derived by determining single-user capacities for each user and calculating a sum capacity upper bound by relaxing the input constraints.

Coded Caching for Broadcast Networks with User Cooperation.

Caching technique is a promising approach to reduce the heavy traffic load and improve user latency experience for the Internet of Things (IoT). In this paper, by exploiting edge cache resources and communication opportunities in device-to-device (D2D) networks and broadcast networks, two novel coded caching schemes are proposed that greatly reduce transmission latency for the centralized and decentralized caching settings, respectively. In addition to the multicast gain, both schemes obtain an additional offered by user cooperation and an additional offered by the parallel transmission among the server and users.

On the Achievable Rate Region of the -Receiver Broadcast Channels via Exhaustive Message Splitting.

This paper focuses on -receiver discrete-time memoryless broadcast channels (DM-BCs) with private messages, where the transmitter wishes to convey private messages to receivers. A general inner bound on the capacity region is proposed based on an exhaustive message splitting and a -level modified Marton's coding. The key idea is to split every message into ∑j=1KKj-1 submessages each corresponding to a set of users who are assigned to recover them, and then send these submessages via codewords chosen from a -level structure codebooks.

On the Capacity Regions of Degraded Relay Broadcast Channels with and without Feedback.

The four-node relay broadcast channel (RBC) is considered, in which a transmitter communicates with two receivers with the assistance of a relay node. We first investigate three types of physically degraded RBCs (PDRBCs) based on different degradation orders among the relay and the receivers' observed signals. For the discrete memoryless (DM) case, only the capacity region of the second type of PDRBC is already known, while for the Gaussian case, only the capacity region of the first type of PDRBC is already known.

A Graph-Based Author Name Disambiguation Method and Analysis via Information Theory.

Name ambiguity, due to the fact that many people share an identical name, often deteriorates the performance of information integration, document retrieval and web search. In academic data analysis, author name ambiguity usually decreases the analysis performance. To solve this problem, an author name disambiguation task is designed to divide documents related to an author name reference into several parts and each part is associated with a real-life person.