On theory of linear network coding

Li, S.-Y.R.; Cai, Ning; Yeung, Raymond W.

doi:10.1109/isit.2005.1523337

Cited by 26 publications

(14 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A node can multiply some coefficient over a finite field with a fixed size of data in the original message, and combine its data with these coefficients as shown in [15] [16].…”

Section: Methodsmentioning

confidence: 99%

“…It means, converting these packets to one packet and send it over outgoing links. With linear network coding, outgoing packets are linear combinations of the original packets, where addition and multiplication are performed over the finite field GF as showed in [7] [ 15] [14], and also has been described by an example in [16] .In Linear Network Coding, each unit of data is processed using finite fields , which q is a prime number or, assuming a Galois Figure 1 illustrates an acyclic network with w = 2 imaginary channels appended at the source node S. For better understanding the linear network coding using Butterfly network which is the best choice. The source node generates the messages; each message would be associated with an element of GF, and then sent over the network.…”

Section: Methodsmentioning

confidence: 99%

See 1 more Smart Citation

A proposed P2P Kurdistan Academic Network Backbone (KANB), Based on Random Linear Network Coding

Yousif

Youeel

Kareem

2017

KJAR

View full text Add to dashboard Cite

Abstract:The current rate of growth in computer network usage is a problematic issue motivates the inspiration to investigate less conventional solutions, similar to Network Coding (NC) which has attracted a lot of attention lately, to improve the bandwidth utilization and latency in computer networks. The objective of this paper is to show that the usage of Network coding is possible on enhancing the execution of Kurdistan Academic Network Backbone (KANB) to associate the primary ten urban communities in Kurdistan Region that almost contains a greater part of academic institutions. The proposed model applies peer to peer (P2P) multicasting on KANB, which does not require any centralized knowledge about the topology of the network. The Random Linear Network Coding (RLNC) has been utilized for its superior properties to address the problems of delay, throughput and lake of security associated with store-and-forward based classical networks. Simulation results point out the advantages of using network coding over the classical (store and forward) technique in term of improving the throughput gain and latency reduction. Hawler city the capital and greatest city in Kurdistan Region have been chosen as a source node while Slemani city has been elected as a sink, node. Thus, Network coding is applied at intermediate nodes.

show abstract

“…A node can multiply some coefficient over a finite field with a fixed size of data in the original message, and combine its data with these coefficients as shown in [15] [16].…”

Section: Methodsmentioning

confidence: 99%

Section: Methodsmentioning

confidence: 99%

A proposed P2P Kurdistan Academic Network Backbone (KANB), Based on Random Linear Network Coding

Yousif

Youeel

Kareem

2017

KJAR

View full text Add to dashboard Cite

show abstract

“…An overview of network coding and a discussion of the potentials are given in paper [6]. Linear network coding has been explored a lot [5] , [11], [12].…”

Section: Related Work and Analysismentioning

confidence: 99%

Massive Data Delivery in Unstructured Peer-to-Peer Networks with Network Coding

2007

6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007)

View full text Add to dashboard Cite

With more and more multimedia applications on the Internet, such as IPTV, bandwidth becomes a vital bottleneck for the booming of large scale Internet based multimedia applications. Network coding is recently proposed to take advantage to use network bandwidth efficiently. In this paper, we focus on massive multimedia data, e.g. IPTV programs, transportation in peer-to-peer networks with network coding. By through study of networking coding, we pointed out that the prerequisites of bandwidth saving of network coding are: 1) one information source with a number of concurrent receivers, or 2) information pieces cached at intermediate nodes. We further proof that network coding can not gain bandwidth saving at immediate connections to a receiver end; As a result, we propose a novel model for IPTV data transportation in unstructured peer-to-peer networks with network coding. Our preliminary simulations show that the proposed architecture works very well.

show abstract

“…In this configuration, a frame of N total packets is combined at the sender using random, non-zeros and linearly independent coefficients from a known and finite field. The mixed packets are then broadcast to all receivers in the network until each one successfully receives N total of these combinations [32,33].…”

Section: Introduction To Network Codingmentioning

confidence: 99%

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications

Douik

Sorour

Al-Naffouri

et al. 2017

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications Ahmed DouikFrom its introduction to its quindecennial, network coding has built a strong reputation in enhancing the packet recovery process and achieving maximum information flow in both wired and wireless networks. Traditional studies focused on optimizing the throughput of the network by proposing complex schemes that achieve optimal delay. With the shift toward distributed computing on mobile devices, throughput and complexity become both critical factors that affect the efficiency of a coding scheme. Instantly decodable network coding imposed itself as a new paradigm in network coding that trades off these two aspects. This paper presents a survey of instantly decodable network coding schemes that are proposed in the literature. The various schemes are identified, categorized and evaluated. Two categories can be distinguished namely the conventional centralized schemes and the distributed or cooperative schemes. For each scheme, the comparison is carried out in terms of reliability, performance, complexity and packet selection methodology. Although the performance is generally inversely proportional to the computation complexity, numerous successful schemes from both the performance and complexity viewpoint are identified.

show abstract

On theory of linear network coding

Abstract: This paper extends the part of the theory on linear network coding [4] over an acyclic network. The extension also applies to "static linear network code" that is introduced by [3]. Another objective is the rigorous clarification of fundamental concepts in linear network coding.

Cited by 26 publications

References 7 publications

A proposed P2P Kurdistan Academic Network Backbone (KANB), Based on Random Linear Network Coding

A proposed P2P Kurdistan Academic Network Backbone (KANB), Based on Random Linear Network Coding

Massive Data Delivery in Unstructured Peer-to-Peer Networks with Network Coding

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications

Contact Info

Product

Resources

About