نتایج جستجو برای: linear network coding

تعداد نتایج: 1226075  

Journal: :CoRR 2016
Jessica Claridge Ioannis Chatzigeorgiou

In the literature there exists analytical expressions for the probability of a receiver decoding a transmitted source message that has been encoded using random linear network coding. In this work, we look into the probability that the receiver will decode at least a fraction of the source message, and present an exact solution to this problem for both non-systematic and systematic network codi...

2002
Muriel Médard Ralf Koetter

In this paper we consider the issue of network capacity. The recent work by Li and Yeung examined the network capacity of multicast networks and related capacity to cutsets. Capacity is achieved by coding over a network. We present a new framework for studying networks and their capacity. Our framework, based on algebraic methods, is surprisingly simple and effective. For networks which are res...

2013
Johan P. Hansen

We present a general theory to obtain good linear network codes utilizing the osculating nature of algebraic varieties. In particular, we obtain from the osculating spaces of Veronese varieties explicit families of equidimensional vector spaces, in which any pair of distinct vector spaces intersect in the same dimension. Linear network coding transmits information in terms of a basis of a vecto...

Journal: :IEICE Transactions 2011
Takahiro Matsuda Taku Noguchi Tetsuya Takine

This survey summarizes the state-of-the-art research on network coding, mainly focusing on its applications to computer networking. Network coding generalizes traditional store-and-forward routing techniques by allowing intermediate nodes in networks to encode several received packets into a single coded packet before forwarding. Network coding was proposed in 2000, and since then, it has been ...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2014
Shachar Lovett

Network coding studies the capacity of networks to carry information, when internal nodes are allowed to actively encode information. It is known that for multi-cast networks, the network coding capacity can be achieved by linear codes. It is also known not to be true for general networks. The best separation to date is by Dougherty et al. [IEEE Trans. Information Theory, 2005] who constructed ...

Journal: :CoRR 2010
Kai Cai Khaled Ben Letaief Pingyi Fan Rongquan Feng

In this paper, we propose a subnetwork decomposition/combination approach to investigate the single rate 2-pair unicast problem. It is shown that the solvability of a 2-pair unicast problem is completely determined by four specific link subsets, namely, A1,1, A2,2, A1,2 and A2,1 of its underlying network. As a result, an efficient cut-based algorithm to determine the solvability of a 2-pair uni...

2015
János Tapolcai

The purpose of this document is to summarize the theoretical results, implementation considerations, deployment details, and measurement results reached in the MINERVA project. During our theoretical work we identified a special case of network coding which is able to maintain scalability and simplicity, and through our implementation we showed that it is a viable approach in transport networks.

Journal: :CoRR 2007
Leonard H. Grokop David Tse

Much of the existing work on the broadcast channel focuses only on the sending of private messages. In this work we examine the scenario where the sender also wishes to transmit common messages to subsets of receivers. For an L-user broadcast channel there are 2L−1 subsets of receivers and correspondingly 2L−1 independent messages. The set of achievable rates for this channel is a 2 − 1-dimensi...

2012
Mathis Seidl Michael Cyran Johannes B. Huber

A differential precoding scheme for random linear network coding is proposed and assessed. We derive the sets of parameters for which the use of higher rates and smaller packet lengths is possible when compared to the standard approach using a lifting construction. It is demonstrated how rank-metric codes may be used for this differential coding approach in order to improve performance and to d...

Journal: :CoRR 2009
Stanislav Bulygin Olav Geil Diego Ruano

Kötter and Kschischang showed in [1] that the network coding counterpart of Gabidulin codes performs asymptotically optimal with respect to the subspace distance. Recently, Silva and Kschischang introduced in [2] the injection distance to give a detailed picture of what happens in noncoherent network coding. We show that the above codes are also asymptotically optimal with respect to this dista...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->