Related papers: Optimality and Rate-Compatibility for Erasure-Code…
Joint network-channel codes (JNCC) can improve the performance of communication in wireless networks, by combining, at the physical layer, the channel codes and the network code as an overall error-correcting code. JNCC is increasingly…
This paper investigates the construction of linear network codes for broadcasting a set of data packets to a number of users. The links from the source to the users are modeled as independent erasure channels. Users are allowed to inform…
In this work, we explore the potential and optimal use of transmitter cooperation in wireless interference networks with deep fading conditions. We consider a linear interference network with K transmitter-receiver pairs, where each…
Maximum distance separable erasure coding has been introduced in wireless networks based on random medium access protocols in order to recover collided and erased packets. So, this help to avoid retransmission process which weaken the…
This paper studies pliable index coding, in which a sender broadcasts information to multiple receivers through a shared broadcast medium, and the receivers each have some message a priori and want any message they do not have. An approach,…
Recent studies have shown that retransmissions can cause heavy-tailed transmission delays even when packet sizes are light-tailed. Moreover, the impact of heavy-tailed delays persists even when packets size are upper bounded. The key…
For delay-limited communication over block-fading channels, the difference between the ergodic capacity and the maximum achievable expected rate for coding over a finite number of coherent blocks represents a fundamental measure of the…
Peer-to-peer distributed storage systems provide reliable access to data through redundancy spread over nodes across the Internet. A key goal is to minimize the amount of bandwidth used to maintain that redundancy. Storing a file using an…
This paper considers optimization of power and delay in a time-varying wireless link using rateless codes. The link serves a sequence of variable-length packets. Each packet is coded and transmitted over multiple slots. Channel conditions…
This paper proposes an encoding/decoding framework for achieving the optimal channel capacities of the two-user broadcast channel where each user (receiver) has the message targeted for the other user (receiver) as side information. Since…
A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that…
The conversational quality of voice over IP (VoIP) depends on packet-loss rates, burstiness of packet loss, and delays (or latencies). The benefits for conversational voice quality of erasure coding attributable to its reduction in packet…
In this paper, we aim to identify the strategies that can maximize and monotonically increase the density of the coding opportunities in instantly decodable network coding (IDNC).Using the well-known graph representation of IDNC, first…
This work considers space-time block coding for the Rayleigh fading multiple-input multiple-output (MIMO) multiple access channel (MAC). If we suppose that the receiver is performing joint maximum-likelihood (ML) decoding, optimizing a MIMO…
User cooperation is a well-known approach to achieve diversity without multiple antennas, however at the cost of inevitable loss of rate mostly due to the need of additional channels for relaying. A new collaborative diversity scheme is…
The explosion of the amount of data stored in cloud systems calls for more efficient paradigms for redundancy. While replication is widely used to ensure data availability, erasure correcting codes provide a much better trade-off between…
The amount of digital data is rapidly growing. There is an increasing use of a wide range of computer systems, from mobile devices to large-scale data centers, and important for reliable operation of all computer systems is mitigating the…
We derive the optimum second-order coding rates, known as second-order capacities, for erasure and list decoding. For erasure decoding for discrete memoryless channels, we show that second-order capacity is $\sqrt{V}\Phi^{-1}(\epsilon_t)$…
The interplay between timeliness and rate efficiency is investigated in packet erasure broadcast channels with feedback. A scheduling framework is proposed in which coding actions, as opposed to users, are scheduled to attain desired…
The problem of interference management is considered in the context of a linear interference network that is subject to long term channel fluctuations due to shadow fading. The fading model used is one where each link in the network is…