Optimal solution for the index coding problem using network coding over GF(2)

@article{Qureshi2012OptimalSF,
  title={Optimal solution for the index coding problem using network coding over GF(2)},
  author={Jalaluddin Qureshi and C. Foh and Jianfei Cai},
  journal={2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)},
  year={2012},
  pages={209-217}
}
  • Jalaluddin Qureshi, C. Foh, Jianfei Cai
  • Published 2012
  • Computer Science, Mathematics
  • 2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)
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โ€ฆย Expand
Reliable Hybrid Systematic Network Coding for Multicast Services in 5G Networks
TLDR
Numerical results show that HSNC, with or without a sliding window, outperforms RLNC and SNC in terms of the decoding probability and has lower bit overhead and computational cost. Expand
Efficient P2P Live Video Streaming Over Hybrid WMNs Using Random Network Coding
TLDR
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. Expand
Design and experiment of testbed using network coding for power management
TLDR
The design and implementation of a wireless testbed for the purpose of energy-aware resource management in networked embedded systems and the results show that the network coding is indeed beneficial under poor channel and heavy network traffic conditions even when all the encoding and decoding overheads are accounted. Expand
SIGBED Review Vol. 12, Num. 3, June 2015
Energy optimization is an important problem in modern wireless embedded systems. In recent years, several techniques have been proposed to optimize power consumption at the computing andโ€ฆ Expand
A limited feedback based network coding retransmission scheme for machine-to-machine wireless broadcasting
TLDR
Theoretical analysis and simulation results show that in the proposed LFNCR, only extreme few feedback is required, compared with traditional full feedback based network coding retransmission schemes, meanwhile acceptable broadcast efficiency could be achieved. Expand
Packet Dropping and Decoding Statistics for Linear Network Coded Broadcast with Feedback
  • Sovanjyoti Giri, R. Roy
  • Computer Science
  • 2018 IEEE 43rd Conference on Local Computer Networks Workshops (LCN Workshops)
  • 2018
TLDR
An n-dimensional Markov chain-based model is developed that enables us to compute the probability of dropping a packet from sender queue at the end of a particular time slot and the idea of first time dropping is proposed, which is used to find expected time to drop a packets from the sender queue. Expand
On NACK-Based rDWS Algorithm for Network Coded Broadcast
TLDR
This paper presents a randomized version of the Drop when seen technique (rDWS), where the unique strength of the DWS, which is the senderโ€™s ability to drop a packet even before its decoding at receivers, is not compromised. Expand
Zigzag-Decodable Reconstruction Codes With Asymptotically Optimal Repair for All Nodes
TLDR
It is shown that the proposed two classes of ZDR codes can be decoded by the zigzag decoding algorithm and have less computational complexity than the existing codes with asymptotically or exactly minimum repair bandwidth. Expand
MATIN: A Random Network Coding Based Framework for High Quality Peer-to-Peer Live Video Streaming
TLDR
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. Expand
Joint balanced source and network coding
We introduce a method that combines joint balanced source and network coding in optical packet-switched networks. It is an efficient way to combat packet loss that occurs due to contentions, toโ€ฆ Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 36 REFERENCES
On Code Parameters and Coding Vector Representation for Practical RLNC
TLDR
It is shown that moderate field sizes are the correct choice when trade-offs are considered inRandom Linear Network Coding, and the results show that sparse binary codes perform the best, unless the generation size is very low. Expand
On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks
TLDR
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. Expand
Network coding-based reliable multicast in wireless networks
TLDR
This work proposes two new schemes to encode packets with more general coding operations, which not only can encode lost packets with common intended receivers together to fully exploit the potential coding opportunities but also have polynomial-time complexity. Expand
Efficient algorithms for Index Coding
TLDR
Numerical study shows that exact solutions can be efficiently obtained for small instances of the index coding problem, while heuristic solutions with low computation time can achieve near-optimal performance for large instances. Expand
Generation of innovative and sparse encoding vectors for broadcast systems with feedback
  • H. Y. Kwan, K. Shum, C. Sung
  • Computer Science, Mathematics
  • 2011 IEEE International Symposium on Information Theory Proceedings
  • 2011
TLDR
It is proved that the problem of determining the existence of an innovative encoding vector is NP-complete when the finite field size is two and it is shown that it can always be found an encoding vector which is both innovative and sparse. Expand
On Network Coding for Stable Multicast Communication
TLDR
The comparison of (deterministic and random) linear network coding schemes with plain retransmission policies opens up several new questions regarding the tradeoffs of stable throughput, energy efficiency, packet overhead and complexity. Expand
Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding
TLDR
This work model coding over generations with random generation scheduling as a coupon collector's brotherhood problem to derive the expected number of coded packets needed for successful decoding of the entire content as well as the probability of decoding failure and quantify the tradeoff between computational complexity and throughput. Expand
On the Sparsity of a Linear Network Code for Broadcast Systems with Feedback
One method for reducing the decoding complexity of network coding in wireless broadcast systems is to generate sparse encoding vectors. The problem of finding the minimal Hamming weight of innovativeโ€ฆ Expand
Wireless Broadcast Using Network Coding
TLDR
Both simulations and theoretical analysis confirm the advantages of the proposed network coding schemes over the ARQ ones and derive a few theoretical results on the bandwidth efficiency. Expand
Network Coding for Mobile Devices - Systematic Binary Random Rateless Codes
TLDR
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. Expand
...
1
2
3
4
...