Results 281 to 290 of about 426,398 (306)
Some of the next articles are maybe not open access.
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
On Convolutional Network Coding
2006 IEEE International Symposium on Information Theory, 2006Convolutional network coding deals with the propagation of a message pipeline through a cyclic network. We formulate a convolutional network code by associating every pair of adjacent channels with a rational power series over the base field, called the local encoding kernel, and every channel with a concomitant global encoding kernel, which is a ...
Shuo-Yen Robert Li, Raymond W. Yeung
openaire +1 more source
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
Convolutional network codes are considered for cyclic graphs. In CNC each node receives several streams and generates output streams whose current symbols depend on the current input symbols and previous input symbols in the node memory. A multicast CNC can be constructed using an algorithm, in order to minimize the memory and overhead, coefficients of
Elona Erez, Meir Feder
openaire +1 more source
Convolutional network codes are considered for cyclic graphs. In CNC each node receives several streams and generates output streams whose current symbols depend on the current input symbols and previous input symbols in the node memory. A multicast CNC can be constructed using an algorithm, in order to minimize the memory and overhead, coefficients of
Elona Erez, Meir Feder
openaire +1 more source
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
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
2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing, 2011
Gossip is a scalable and easy-to-deploy broadcast method for distributed systems. In gossip a broadcast message is disseminated through repeated information exchanges between randomly chosen nodes. Gossip can also achieve high reliability using a large amount of redundant messages, but this also incurs high load on the network.
Shun Tokuyama +2 more
openaire +1 more source
Gossip is a scalable and easy-to-deploy broadcast method for distributed systems. In gossip a broadcast message is disseminated through repeated information exchanges between randomly chosen nodes. Gossip can also achieve high reliability using a large amount of redundant messages, but this also incurs high load on the network.
Shun Tokuyama +2 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 +1 more source
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 +1 more source
Certificateless anti-quantum ring signcryption for network coding
Knowledge-Based Systems, 2022Huifang Yu
exaly
Network Coding Theory: A Survey
IEEE Communications Surveys and Tutorials, 2013Riccardo Bassoli +2 more
exaly