3 Résumé étendu de la thèse en français 5

With the rapid increase in the popularity of wireless devices (e.g. smartphones and tablets) and watching videos over the Internet, delivering high quality videos to mobile users over wireless links is becoming an important application. Diversity of the receivers is a main challenge ofmulticasting in wireless networks, where variant channel conditions of end users lead to different packet deliv...

Consider a multi-source network coding problem with correlated sources. While the fundamental limits are known, achieving them, in general, involves a computational burden due to the complex decoding process. Efficient solutions, on the other hand, are by large based on source and network coding separation, thus imposing strict topological constraints on the networks which can be solved. In thi...

Multi-Generation Mixing (MGM) is a generalized approach of Network Coding (NC) that has its improvements when applied in packet loss networks. In this paper we apply MGM network coding in networks communicating video contents. NC has shown viable improvements when applied in packet loss networks. With practical network coding (generation based network coding), packets are grouped in chunks call...

In practice, since many communication networks are huge in scale, or complicated in structure, or even dynamic, the predesigned linear network codes based on the network topology is impossible even if the topological structure is known. Therefore, random linear network coding has been proposed as an acceptable coding technique for the case that the network topology cannot be utilized completely...

Motivated by practical networking scenarios, we introduce a notion of restricted communication called conservative networking. Consider a network of lossless links and a number of independent sources. Each node needs to recover a certain subset of the sources. However, each node is conservative in that all information it receives can only be a function of the sources it will ultimately recover....

In this paper, a multi–source multi–relay cooperative wireless network with binary network coding is studied. The system model encompasses: i) a demodulate–and–forward protocol at the relays, where the received packets are forwarded regardless of their reliability; and ii) a maximum–likelihood optimum decoder at the destination, which accounts for possible decoding errors at the relays. An asym...

In this paper, we consider the problem of building a secure network against node conspiracy attack that based on network segmentation. As we know, network coding has demonstrated its great application prospects in wireless sensor network (WSN) transmission. At the same time, it is facing a variety of security threats, especially conspiracy attack. In existing research, secure coding design stra...

In this paper, we are interested in the number of fixed points of functions f : An → An over a finite alphabet A defined on a given signed digraph D. We first use techniques from network coding to derive some lower bounds on the number of fixed points that only depends on D. We then discover relationships between the number of fixed points of f and problems in coding theory, especially the desi...

of thesis entitled: Network Coding for Security and Error Correction Submitted by NGAI, Chi Kin for the degree of Doctor of Philosophy at The Chinese University of Hong Kong in July 2008 Network coding is one of the most important breakthroughs in information theory in recent years. The theory gives rise to a new concept regarding the role of nodes in a communication network. Unlike in existing...