Optimal Solution for the Index Coding Problem Using Network Coding over GF(2)
TL;DR: In this paper, the authors proposed a throughput optimal triangular network coding scheme over GF(2), which can supply unlimited number of innovative packets and the decoding involves the simple back substitution, and showed that such a coding scheme provides an efficient solution to the index coding problem and its lower computation and energy cost makes it suitable for practical implementation on devices with limited processing and energy capacity.
read more
Abstract: The index coding problem is a fundamental transmission problem which occurs in a wide range of multicast networks. Network coding over a large finite field size has been shown to be a theoretically efficient solution to the index coding problem. However the high computational complexity of packet encoding and decoding over a large finite field size, and its subsequent penalty on encoding and decoding throughput and higher energy cost makes it unsuitable for practical implementation in processor and energy constraint devices like mobile phones and wireless sensors. While network coding over GF(2) can alleviate these concerns, it comes at a tradeoff cost of degrading throughput performance. To address this tradeoff, we propose a throughput optimal triangular network coding scheme over GF(2). We show that such a coding scheme can supply unlimited number of innovative packets and the decoding involves the simple back substitution. Such a coding scheme provides an efficient solution to the index coding problem and its lower computation and energy cost makes it suitable for practical implementation on devices with limited processing and energy capacity.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Network Coding in Cognitive Radio Networks: A Comprehensive Survey
TL;DR: A comprehensive survey of NC schemes in cognitive radio networks is provided, highlighting the motivations for and the applications of NC in CRNs.
84
A New Zigzag-Decodable Code with Efficient Repair in Wireless Distributed Storage
TL;DR: A new class of codes which can be decoded by the zigzag-decoding algorithm is considered, which has a lower decoding complexity at the expense of extra storage overhead in each parity packet.
34
Matin: a random network coding based framework for high quality peer-to-peer live video streaming
Behrang Barekatain,Dariush Khezrimotlagh,Mohd Aizaini Maarof,Hamid Reza Ghaeini,Shaharuddin Salleh,Alfonso Ariza Quintana,Behzad Akbari,Alicia Triviño Cabrera +7 more
TL;DR: The results obtained from simulation using OMNET++ show that the MATIN substantially outperforms the RNC which uses the Gauss-Jordan elimination method by providing better video quality on peers in terms of the four important performance metrics including video distortion, dependency distortion, End-to-End delay and Initial Startup delay.
Efficient P2P Live Video Streaming Over Hybrid WMNs Using Random Network Coding
Behrang Barekatain,Dariush Khezrimotlagh,Mohd Aizaini Maarof,Hamid Reza Ghaeini,Alfonso Ariza Quintana,Alicia Triviño Cabrera +5 more
TL;DR: Simulation results in the OMNeT++ framework depict that the applied method provides high video quality on the nodes by addressing the mentioned challenges, even if high mobility rates exist in the WMN.
20
New Fountain Codes With Improved Intermediate Recovery Based on Batched Zigzag Coding
TL;DR: It is shown that the proposed codes outperform Luby transform codes and zigzag decodable fountain codes with respect to intermediate recovery rate and coding overhead when message length is short, symbol erasure rate is low, and available buffer size is limited.
20
References
•Book
Handbook of Applied Cryptography
Alfred Menezes,Scott A. Vanstone,Paul C. van Oorschot +2 more
- 01 Jan 1996
TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
15K
XORs in the air: practical wireless network coding
TL;DR: The results show that using COPE at the forwarding layer, without modifying routing and higher layers, increases network throughput, and the gains vary from a few percent to several folds depending on the traffic pattern, congestion level, and transport protocol.
The global footprint of mobile communications: The ecological and economic perspective
TL;DR: The global carbon footprint of mobile communication systems is quantified, which reveals that production of mobile devices and global radio access network operation will remain the major contributors, accompanied by an increasing share of emissions due to data transfer in the backbone resulting from rising mobile traffic volumes.
804
Network Coding for Mobile Devices - Systematic Binary Random Rateless Codes
Janus Heide,Morten V. Pedersen,Frank H. P. Fitzek,Torben Larsen +3 more
- 14 Jun 2009
TL;DR: This paper proposes to base RLNC on the binary Galois field and to use a systematic code to achieve synthetic encoding/decoding throughput of up to 40/30 MB/s on a Nokia N95-8GB mobile phone and 1.5/1.0 GB/son a high end laptop.
•Posted Content
On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks
TL;DR: This paper shows that the fundamental problem of finding the optimal encoding for the broadcasted packets that minimizes the overall number of transmissions is NP-complete over GF(2) and establishes several fundamental properties of the optimal solution.
134