Results 271 to 280 of about 426,398 (306)
Some of the next articles are maybe not open access.
2008 IEEE International Symposium on Information Theory, 2008
In [4] a metric for error correction in network coding is introduced. Also constant-dimension codes were introduced and investigated. Nevertheless little is known on codes in this metric in general. In this paper, several classes of codes are defined and investigated.
Ernst M. Gabidulin, Martin Bossert
openaire +1 more source
In [4] a metric for error correction in network coding is introduced. Also constant-dimension codes were introduced and investigated. Nevertheless little is known on codes in this metric in general. In this paper, several classes of codes are defined and investigated.
Ernst M. Gabidulin, Martin Bossert
openaire +1 more source
Iterative Coding for Network Coding
IEEE Transactions on Information Theory, 2013We consider communication over a noisy network under randomized linear network coding. Possible error mechanisms include node- or link-failures, Byzantine behavior of nodes, or an overestimate of the network min-cut. Building on the work of Kotter and Kschischang, we introduce a systematic oblivious random channel model.
Andrea Montanari, Rüdiger L. Urbanke
openaire +1 more source
Algebraic codes for network coding
Problems of Information Transmission, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ernst M. Gabidulin, Martin Bossert
openaire +2 more sources
Coding for a network coded fountain
2011 IEEE International Symposium on Information Theory Proceedings, 2011Batched sparse (BATS) codes are proposed for transmitting a collection of packets through communication networks employing linear network coding. BATS codes generalize fountain codes and preserve the properties such as ratelessness and low encoding/decoding complexity. Moreover, the buffer size and the computation capability of the intermediate network
Shenghao Yang 0001, Raymond W. Yeung
openaire +1 more source
IEEE Wireless Communications Letters, 2015
With network coding, received packets are linearly combined together and broadcasted over the network. Several techniques exist in the literature dedicated to the process of combining packets. However, these techniques focus on forwarding and decoding coded packets without taking into consideration the life cycle of each individual packet.
Samih Abdul-Nabi +3 more
openaire +2 more sources
With network coding, received packets are linearly combined together and broadcasted over the network. Several techniques exist in the literature dedicated to the process of combining packets. However, these techniques focus on forwarding and decoding coded packets without taking into consideration the life cycle of each individual packet.
Samih Abdul-Nabi +3 more
openaire +2 more sources
Network coding in star networks
2008 IEEE International Symposium on Information Theory, 2008We investigate network coding in star networks with multiple unicast sessions. We use entropy arguments to upper bound the simultaneous rates of communication among the different nodes in the network and prove that in many cases, the optimal network code is related to the combinatorial optimization problem of finding the maximum number of edge disjoint
S. M. Sadegh +3 more
openaire +1 more source
On Network Coding for Funnel Networks
IEEE Communications Letters, 2015Network coding for non-multicast problems has been the subject of many recent studies. In this letter, we consider networks in which the total capacity of the incoming links to each intermediate node is not less than the total capacity of its outgoing links.
Pourya Karimian +2 more
openaire +1 more source
Network Coding-Based Network Coding Recovery Scheme
2012 IEEE 15th International Conference on Computational Science and Engineering, 2012Network coding has been considered as an effective approach to improve the wireless network throughput. However, due to the unreliability of wireless links and the loss of transmission, the decoded node sometimes cannot receive enough native packets to succeed in decoding.
Yunlong Zhao 0001 +4 more
openaire +1 more source
2013 IEEE International Symposium on Information Theory, 2013
A network switch routes data packets between its multiple input and output ports. Packets from input ports are stored upon arrival in a switch fabric comprising multiple memory banks. This can result in memory contention when distinct output ports request packets from the same memory bank, resulting in a degraded switching bandwidth.
Zhiying Wang 0001 +3 more
openaire +1 more source
A network switch routes data packets between its multiple input and output ports. Packets from input ports are stored upon arrival in a switch fabric comprising multiple memory banks. This can result in memory contention when distinct output ports request packets from the same memory bank, resulting in a degraded switching bandwidth.
Zhiying Wang 0001 +3 more
openaire +1 more source
IEEE Transactions on Information Theory, 2003
Summary: Consider a communication network in which certain source nodes multicast information to other nodes on the network in the multihop fashion where every node can pass on any of its received data to others. We are interested in how fast each node can receive the complete information, or equivalently, what the information rate arriving at each ...
Shuo-Yen Robert Li +2 more
openaire +2 more sources
Summary: Consider a communication network in which certain source nodes multicast information to other nodes on the network in the multihop fashion where every node can pass on any of its received data to others. We are interested in how fast each node can receive the complete information, or equivalently, what the information rate arriving at each ...
Shuo-Yen Robert Li +2 more
openaire +2 more sources