Results 231 to 240 of about 414,943 (258)
Some of the next articles are maybe not open access.
2015 IEEE International Symposium on Information Theory (ISIT), 2015
We establish connections between graph theoretic symmetry, symmetries of network codes, and symmetries of rate regions for k-unicast network coding and multi-source network coding. We identify a group we call the network symmetry group as the common thread between these notions of symmetry and characterize it as a subgroup of the automorphism group of ...
Jayant Apte, John MacLaren Walsh
openaire +1 more source
We establish connections between graph theoretic symmetry, symmetries of network codes, and symmetries of rate regions for k-unicast network coding and multi-source network coding. We identify a group we call the network symmetry group as the common thread between these notions of symmetry and characterize it as a subgroup of the automorphism group of ...
Jayant Apte, John MacLaren Walsh
openaire +1 more source
2010 6th International Symposium on Turbo Codes & Iterative Information Processing, 2010
Error-correcting coding is introduced in associative memories based on Hopfield networks in order to increase the learning diversity as well as the recall robustness in presence of erasures and errors. To achieve this, the graph associated with the classical Hopfield network is transformed into a bipartite graph in which incoming information is linked ...
Berrou, Claude, Gripon, Vincent
openaire +2 more sources
Error-correcting coding is introduced in associative memories based on Hopfield networks in order to increase the learning diversity as well as the recall robustness in presence of erasures and errors. To achieve this, the graph associated with the classical Hopfield network is transformed into a bipartite graph in which incoming information is linked ...
Berrou, Claude, Gripon, Vincent
openaire +2 more sources
Designs, Codes and Cryptography, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dirk Liebhold +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dirk Liebhold +2 more
openaire +1 more source
Homomorphic authentication codes for network coding
Concurrency and Computation: Practice and Experience, 2013SummaryAuthentication codes (A‐codes) are a well studied technique to provide unconditionally secure authentication. An A‐code is defined by a map that associates a pair formed by a message and a key to a tag. A‐codes linear in the keys have been studied for application to distributed authentication schemes. In this paper, we address the dual question,
openaire +1 more source
Network Coding With Interleaving
2007 International Conference on Parallel Processing Workshops (ICPPW 2007), 2007Interleaving is a scheme of adapting random error-correcting codes to bursty channels in the classical coding theory Network coding has been first introduced as a new paradigm of improving network throughput by allowing coding of incoming messages at the intermediate nodes.
Zheng Huang +3 more
openaire +1 more source
2010 7th IEEE Consumer Communications and Networking Conference, 2010
Network coding is a useful tool to increase the multicast capacity of networks. The traditional approach to network coding involving XOR operation has several limitations such as low robustness and can support only two users/packets at a time, per relay, in the mixing process to achieve optimal error performance.
Bilal Zafar 0001 +2 more
openaire +2 more sources
Network coding is a useful tool to increase the multicast capacity of networks. The traditional approach to network coding involving XOR operation has several limitations such as low robustness and can support only two users/packets at a time, per relay, in the mixing process to achieve optimal error performance.
Bilal Zafar 0001 +2 more
openaire +2 more sources
2005
In the network coding problem, there are k commodities each with an associated message Mi, a set of sources that know Mi and a set of sinks that request Mi. Each edge in the graph may transmit any function of the messages. These functions define a network coding solution. We explore three topics related to network coding.
openaire +1 more source
In the network coding problem, there are k commodities each with an associated message Mi, a set of sources that know Mi and a set of sinks that request Mi. Each edge in the graph may transmit any function of the messages. These functions define a network coding solution. We explore three topics related to network coding.
openaire +1 more source
Network Coding Theory: A Survey
IEEE Communications Surveys and Tutorials, 2013Kenneth Wing-Ki Shum +1 more
exaly
Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications
IEEE Communications Surveys and Tutorials, 2017Tareq Y Al-Naffouri +2 more
exaly
Network Coding in Cognitive Radio Networks: A Comprehensive Survey
IEEE Communications Surveys and Tutorials, 2017Imran Rashid +2 more
exaly