An equivalence between network coding and index coding

We show that the network coding and index coding problems are equivalent. This equivalence holds in the general setting which includes linear and non-linear codes. Specifically, we present an efficient reduction that maps a network coding instance to an index coding instance while preserving feasibility. Previous connections were restricted to the linear case

An equivalence between network coding and index coding

We show that the network coding and index coding problems are equivalent. This equivalence holds in the general setting which includes linear and non-linear codes. Specifically, we present an efficient reduction that maps a network coding instance to an index coding one while preserving feasibility. Previous connections were restricted to the linear case

Robust Network Coding for Bidirected Networks

We consider the problem of finding a linear network code that guarantees an instantaneous recovery from edge failures in communication networks. With instantaneous recovery, lost data can be recovered at the destination without the need for path re-routing or packet re-transmission. We focus on a special class of bidirected networks. In such networks, for each edge there exists a corresponding edge in the reverse direction of equal capacity. We assume that at most one pair of bidirected edges can fail at any time. For unicast connections, we establish an upper bound of O(2^2h) on the minimum required field size and present an algorithm that constructs a linear network code over GF (2^2h). For multicast connections, we show that the minimum required eld size is bounded by O(t · 2^2h), where t is the number of terminals. We also discuss link- and flow-cyclic bidirected coding networks with instantaneous recovery

Data Dissemination in Wireless Sensor Networks with Network Coding

In wireless sensor networks (WSNs), it is often necessary to update the software running on sensors, which requires reliable dissemination of large data objects to each sensor with energy efficiency. During data dissemination, due to sleep scheduling designed for energy efficiency, some sensors may not receive some packets at some time slots. In the meantime, due to the unreliability of wireless communication, a sensor may not successfully receive a packet even when it is in the active mode. Thus, retransmission of such packets to those sensors is necessary, which consumes more energy and increases the delay of data dissemination cycle. In this paper, we propose a network coding-based approach in data dissemination such that data dissemination can be accomplished at the earliest time. Thus, less energy is consumed and the delay can be decreased. The impact of packet loss probability and the sleep probability of sensors on the network coding gain is analyzed. A threshold is also given to decide whether the current sleep scheduling is effective on energy saving in data dissemination process or not. Simulation results demonstrate the effectiveness and scalability of the proposed work

Sexuality, nationalism and the other: the Arabic literary canon between orientalism and the Nahḍa discourse at the Fin de Siècle

This article examines the dual and paradoxical conception of the Arabic literary canon in Orientalist and Nahḍa discourses in the nineteenth and early twentieth centuries—an era of great change and closer mutual cultural awareness between Europe and the Arab world. What Arabic literature had long signified to European scholars since Antoine Galland’s eighteenth-century translation of The Arabian Nights (mysticism, Romanticism and a platform to explore sexual taboos) was very different from how the nationalist-minded Nahḍa intellectuals wanted to reconfigure it as the hallmark of the rational “Golden Age” of Arab civilization. Sexuality became a site of contestation between certain Orientalists who praised Arab literary “frankness” and an anxious class of Arab scholars who wanted to “cleanse” the Arabic literary canon and reconfigure it in line with modern, European standards of “respectability” and “politeness.