English
Related papers

Related papers: Performance Analysis of Random Linear Network Codi…

200 papers

Multi-resolution codes enable multicast at different rates to different receivers, a setup that is often desirable for graphics or video streaming. We propose a simple, distributed, two-stage message passing algorithm to generate network…

Networking and Internet Architecture · Computer Science 2016-11-18 MinJi Kim , Daniel Lucani , Xiaomeng Shi , Fang Zhao , Muriel Medard

In a bi-directional relay channel, a pair of nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of relays. Recent work has mostly considered information theoretic limits of the…

Information Theory · Computer Science 2010-02-02 Sang Joon Kim , Besma Smida , Natasha Devroye

Systems that employ network coding for content distribution convey to the receivers linear combinations of the source packets. If we assume randomized network coding, during this process the network nodes collect random subspaces of the…

Information Theory · Computer Science 2016-11-17 Mahdi Jafari Siavoshani , Christina Fragouli , Suhas Diggavi

Two types of noise-free relay cascades are investigated. Networks where a source communicates with a distant receiver via a cascade of half-duplex constrained relays, and networks where not only the source but also a single relay node…

Information Theory · Computer Science 2016-11-15 Tobias Lutz , Christoph Hausl , Ralf Kötter

It is already known that in multicast (single source, multiple sinks) network, random linear network coding can achieve the maximum flow upper bound. In this paper, we investigate how random linear network coding behaves in general…

Information Theory · Computer Science 2012-10-09 Yuan Li

Using the spatial modulation approach, where only one transmit antenna is active at a time, we propose two transmission schemes for two-way relay channel using physical layer network coding with space time coding using Coordinate…

Information Theory · Computer Science 2014-01-07 K. G. Unnikrishnan , B. Sundar Rajan

In this paper, we investigate the problem of recovering source information from an incomplete set of network coded data. We first study the theoretical performance of such systems under maximum a posteriori (MAP) decoding and derive the…

Information Theory · Computer Science 2015-03-16 Eirina Bourtsoulatze , Nikolaos Thomos , Pascal Frossard

We introduce a method for securely delivering a set of messages to a group of clients over a broadcast erasure channel where each client is interested in a distinct message. Each client is able to obtain its own message but not the others'.…

Information Theory · Computer Science 2013-05-08 Shahriar Etemadi Tajbakhsh , Parastoo Sadeghi , Rodney Kennedy

In this paper we present a multi-user cooperative protocol for wireless networks. Two sources transmit simultaneously their information blocks and relays employ opportunistically successive interference cancellation (SIC) in an effort to…

Networking and Internet Architecture · Computer Science 2016-11-17 Antonios Argyriou

Two-way relaying is one of the major applications of broadband communication satellites, for which an efficient technique is Physical Layer Network Coding (PLNC). Earlier studies have considered satellites employing PLNC with onboard…

Information Theory · Computer Science 2017-03-14 Saket D. Buch , B. Sundar Rajan

This paper studies an almost-lossless source-channel coding scheme in which source messages are assigned to different classes and encoded with a channel code that depends on the class index. The code performance is analyzed by means of…

We analyze a simple network where a source and a receiver are connected by a line of erasure channels of different reliabilities. Recent prior work has shown that random linear network coding can achieve the min-cut capacity and therefore…

Information Theory · Computer Science 2009-10-22 Theodoros K. Dikaliotis , Alexandros G. Dimakis , Tracey Ho , Michelle Effros

In coded bi-directional cooperation, two nodes wish to exchange messages over a shared half-duplex channel with the help of a relay. In this paper, we derive performance bounds for this problem for each of three protocols. The first…

Information Theory · Computer Science 2008-06-05 Sang Joon Kim , Patrick Mitran , Vahid Tarokh

A large number of streaming applications use reliable transport protocols such as TCP to deliver content over the Internet. However, head-of-line blocking due to packet loss recovery can often result in unwanted behavior and poor…

Information Theory · Computer Science 2014-08-08 Jason Cloud , Douglas Leith , Muriel Medard

This paper addresses the fundamental characteristics of information exchange via multihop network coding over two-way relaying in a wireless ad hoc network. The end-to-end rate regions achieved by time-division multihop (TDMH), MAC-layer…

Information Theory · Computer Science 2009-02-16 Chun-Hung Liu , Feng Xue , Jeffrey G. Andrews

The problem of maximum rate achievable with analog network coding for a unicast communication over a layered wireless relay network with directed links is considered. A relay node performing analog network coding scales and forwards the…

Information Theory · Computer Science 2012-05-22 Samar Agnihotri , Sidharth Jaggi , Minghua Chen

Consider the problem of source coding in networks with multiple receiving terminals, each having access to some kind of side information. In this case, standard coding techniques are either prohibitively complex to decode, or require…

Information Theory · Computer Science 2011-11-28 Chen Avin , Michael Borokhovich , Asaf Cohen , Zvi Lotker

Practical random network coding based schemes for multicast include a header in each packet that records the transformation between the sources and the terminal. The header introduces an overhead that can be significant in certain…

Information Theory · Computer Science 2010-06-03 Shizheng Li , Aditya Ramamoorthy

This paper considers the downlink traffic from a base station to two different clients. When assuming infinite backlog, it is known that inter-session network coding (INC) can significantly increase the throughput of each flow. However, the…

Networking and Internet Architecture · Computer Science 2014-10-08 Wei-Cheng Kuo , Chih-Chun Wang

Reminiscent of the parity function in network coding for the butterfly network, it is shown that forwarding an even/odd indicator bit for a scalar quantization of a relay observation recovers 1 bit of information at the two destinations in…

Information Theory · Computer Science 2010-09-10 Peyman Razaghi , Giuseppe Caire
‹ Prev 1 4 5 6 7 8 10 Next ›