Related papers: Channel Coding in Random Access Communication over…
This paper considers rateless network error correction codes for reliable multicast in the presence of adversarial errors. Most existing network error correction codes are designed for a given network capacity and maximum number of errors…
This paper investigates variable-length stop-feedback codes for memoryless channels in point-to-point, multiple access, and random access communication scenarios. The proposed codes employ $L$ decoding times $n_1, n_2, \dots, n_L$ for the…
We study the problem of content delivery in two-user interference channels with altering topology, random available cache at the receivers, and delayed channel knowledge at the transmitter. We establish a new set of outer-bounds on the…
Low-capacity scenarios have become increasingly important in the technology of the Internet of Things (IoT) and the next generation of wireless networks. Such scenarios require efficient and reliable transmission over channels with an…
We consider a communication system with multi-access fading channel. Each user in the system requires certain rate guarantee. Our main contribution is to devise a scheduling scheme called "Opportunistic Super-position Coding" that satisfies…
We consider a cooperative two-user multiaccess channel in which the transmission is controlled by a random state. Both encoders transmit a common message and, one of the encoders also transmits an individual message. We study the capacity…
This paper presents an achievability bound that evaluates the exact probability of error of an ensemble of random codes that are decoded by a minimum distance decoder. Compared to the state-of-the-art which demands exponential computation…
We investigate the achievable rate of data transmission from sources to sinks through a multiple-relay network. We study achievable rates for omniscient coding, in which all nodes are considered in the coding design at each node. We find…
A communication setup is considered where a transmitter wishes to convey a message to a receiver and simultaneously estimates the state of that receiver through a common waveform. The state is estimated at the transmitter by means of…
Communication systems for multicasting information and energy simultaneously to more than one user are investigated. In the system under study, a transmitter sends the same message and signal to multiple receivers over distinct and…
The network communication scenario where one or more receivers request all the information transmitted by different sources is considered. We introduce distributed polynomial-time network codes in the presence of malicious nodes. Our codes…
It is known that, as opposed to point-to-point channel, separate source and channel coding is not optimal in general for sending correlated sources over multiuser channels. In some works joint source-channel coding has been investigated for…
In this paper we provide an achievable rate region for the discrete memoryless multiple access channel with correlated state information known non-causally at the encoders using a random binning technique. This result is a generalization of…
We consider a set of $n$ messages and a group of $k$ clients. Each client is privileged for receiving an arbitrary subset of the messages over a broadcast erasure channel, which generalizes scenario of a previous work. We propose a method…
The problem of maximizing the average rate in a multicast network subject to a coverage constraint (minimum quality of service) is studied. Assuming the channel state information is available only at the receiver side and single antenna…
We consider distributed channel access in multi-hop cognitive radio networks. Previous works on opportunistic channel access using multi-armed bandits (MAB) mainly focus on single-hop networks that assume complete conflicts among all…
In this paper, we characterize the fundamental limits of a communication system with three users (i.e., three transmitters) and a single receiver where communication from two covert users must remain undetectable to an external warden. Our…
In multi-user wireless packet networks interference, typically modeled as packet collision, is the throughput bottleneck. Users become aware of the interference pattern via feedback and use this information for contention resolution and for…
Recently, wireless communication industries have begun to extend their services to machine-type communication devices as well as to user equipments. Such machine-type communication devices as meters and sensors need intermittent uplink…
This paper focuses on the design of medium access control protocols for cognitive radio networks. The scenario in which a single cognitive user wishes to opportunistically exploit the availability of empty frequency bands within parts of…