English
Related papers

Related papers: Compute-and-Forward Network Coding Design over Mul…

200 papers

Compress-forward (CF) schemes are studied in general networks. The CF rate for the one-relay channel defines outerbounds on both the CF rate for general networks and the compression rate-vector region supporting this rate. We show the…

Information Theory · Computer Science 2022-09-22 Jonathan Ponniah

We give an information flow interpretation for multicasting using network coding. This generalizes the fluid model used to represent flows to a single receiver. Using the generalized model, we present a decentralized algorithm to minimize…

Information Theory · Computer Science 2007-07-13 Kapil Bhattad , Niranjan Ratnakar , Ralf Koetter , Krishna R. Narayanan

Multicast remains a fundamental mechanism for scalable content distribution, yet existing approaches face critical limitations. Traditional multicast trees suffer from path redundancy and inefficient utilization of network resources, while…

Networking and Internet Architecture · Computer Science 2025-10-27 Tomas Lestayo Martinez , Manuel Fernandez Veiega Veiga

In this paper, a transmission strategy of fountain codes over cooperative relay networks is proposed. When more than one relay nodes are available, we apply network coding to fountain-coded packets. By doing this, partial information is…

Information Theory · Computer Science 2015-03-17 E. Kurniawan , S. Sun , K. Yen , K. F. E. Chong

In this paper, we study the performance of network-coded cooperative diversity systems with practical communication constraints. More specifically, we investigate the interplay between diversity, coding, and multiplexing gain when the relay…

Information Theory · Computer Science 2016-11-17 Michela Iezzi , Marco Di Renzo , Fabio Graziosi

Compute-and-forward (CAF) relaying is effective to increase bandwidth efficiency of wireless two-way relay channels. In a CAF scheme, a relay is designed to decode a linear combination composed of transmitted messages from other terminals…

Information Theory · Computer Science 2018-07-05 Satoshi Takabe , Tadashi Wadayama , Masahito Hayashi

Maddah-Ali and Niesen's original coded caching scheme for shared-link broadcast networks is now known to be optimal to within a factor two, and has been applied to other types of networks. For practical reasons, this paper considers that a…

Information Theory · Computer Science 2018-04-06 Kai Wan , Mingyue Ji , Pablo Piantanida , Daniela Tuninetti

In this paper we present several strategies for multiple relay networks which are constrained by a half-duplex operation, i. e., each node either transmits or receives on a particular resource. Using the discrete memoryless multiple relay…

Information Theory · Computer Science 2007-12-24 P. Rost , G. Fettweis

Previous approaches to compute-and-forward (C\&F) are mostly based on quantizing channel coefficients to integers. In this work, we investigate the C\&F strategy over block fading channels using Construction A over rings, so as to allow…

Information Theory · Computer Science 2017-05-09 Shanxiang Lyu , Antonio Campello , Cong Ling , Jean-Claude Belfiore

Parallel transmission, as defined in high-speed Ethernet standards, enables to use less expensive optoelectronics and offers backwards compatibility with legacy Optical Transport Network (OTN) infrastructure. However, optimal parallel…

Networking and Internet Architecture · Computer Science 2013-04-03 Xiaomin Chen , Admela Jukan , Muriel Médard

A cross-layer design along with an optimal resource allocation framework is formulated for wireless fading networks, where the nodes are allowed to perform network coding. The aim is to jointly optimize end-to-end transport layer rates,…

Networking and Internet Architecture · Computer Science 2011-05-06 Ketan Rajawat , Nikolaos Gatsis , Georgios B. Giannakis

We present a capacity-achieving coding scheme for unicast or multicast over lossy packet networks. In the scheme, intermediate nodes perform additional coding yet do not decode nor even wait for a block of packets before sending out coded…

Information Theory · Computer Science 2008-04-11 Desmond S. Lun , Muriel Medard , Ralf Koetter , Michelle Effros

Under the emerging network coding paradigm, intermediate nodes in the network are allowed not only to store and forward packets but also to process and mix different data flows. We propose a low-complexity cryptographic scheme that exploits…

Cryptography and Security · Computer Science 2016-11-17 Joao P. Vilela , Luisa Lima , Joao Barros

In this paper, a new two-way relaying scheme based on compute-and-forward (CMF) framework and relay selection strategies is proposed, which provides a higher throughput than the conventional two-way relaying schemes. Two cases of relays…

Information Theory · Computer Science 2014-10-13 Seyed Mohammad Azimi-Abarghouyi , Mohsen Hejazi , Masoumeh Nasiri-Kenari

Compress-forward (CF) relays can improve communication rates even when the relay cannot decode the source signal. Efficient implementation of CF is a topic of contemporary interest, in part because of its potential impact on wireless…

Information Theory · Computer Science 2023-01-10 Heping Wan , Anders Host-Madsen , Aria Nosratinia

This paper proposes a novel joint non-binary network-channel code for the Time-Division Decode-and-Forward Multiple Access Relay Channel (TD-DF-MARC), where the relay linearly combines -- over a non-binary finite field -- the coded…

Information Theory · Computer Science 2016-11-15 Mikel Hernaez , Pedro M. Crespo , Javier Del Ser

In this paper, we investigate the impact of network coding at the relay node on the stable throughput rate in multicasting cooperative wireless networks. The proposed protocol adopts Network-level cooperation in contrast to the traditional…

Information Theory · Computer Science 2010-09-01 Anthony Fanous , Anthony Ephremides

The combination of edge caching and coded multicasting is a promising approach to improve the efficiency of content delivery over cache-aided networks. The global caching gain resulting from content overlap distributed across the network in…

Information Theory · Computer Science 2016-11-17 Parisa Hassanzadeh , Antonia Tulino , Jaime Llorca , Elza Erkip

One of the fundamental challenges in the design of distributed wireless networks is the large dynamic range of network state. Since continuous tracking of global network state at all nodes is practically impossible, nodes can only acquire…

Information Theory · Computer Science 2017-04-18 Alireza Vahid , Vaneet Aggarwal , A. Salman Avestimehr , Ashutosh Sabharwal

Decode-and-forward (D-F) and compress-and-forward (C-F) are two fundamentally different relay strategies proposed by (Cover and El Gamal, 1979). Individually, either of them has been successfully generalized to multi-relay channels. In this…

Information Theory · Computer Science 2012-09-24 Xiugang Wu , Liang-Liang Xie
‹ Prev 1 4 5 6 7 8 10 Next ›