Network information flow
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- A Random Linear Network Coding Approach to Multicast
- A Rank-Metric Approach to Error Control in Random Network Coding
- All-or-nothing encryption and the package transform
- Byzantine Modification Detection in Multicast Networks With Random Network Coding
- Coding for Errors and Erasures in Random Network Coding
- Information theory and network coding
- Linear Network Error Correction Codes in Packet Networks
- Linear network coding
- Network error correction. I: Basic concepts and upper bounds
- Network information flow
- Polynomial Time Algorithms for Multicast Network Code Construction
- Resilient Network Coding in the Presence of Byzantine Adversaries
- Secure Network Coding on a Wiretap Network
- Signatures for network coding
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Something about all or nothing (transforms)
Cited in
(only showing first 100 items - show all)- Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding
- Finite-SNR diversity-multiplexing tradeoff for cooperative transmissions with opportunistic network coding
- Number of fixed points and disjoint cycles in monotone Boolean networks
- A characterization of cyclic subspace codes via subspace polynomials
- Universal secure rank-metric coding schemes with optimal communication overheads
- The minrank of random graphs
- Attractor separation and signed cycles in asynchronous Boolean networks
- Towards robust and efficient computation in dynamic peer-to-peer networks
- A construction of abelian non-cyclic orbit codes
- Several kinds of large cyclic subspace codes via Sidon spaces
- Linear cutting blocking sets and minimal codes in the rank metric
- Asynchronous simulation of Boolean networks by monotone Boolean networks
- Orbit codes from forms on vector spaces over a finite field
- Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory
- Multi-partite entanglement can speed up quantum key distribution in networks
- Secure Error-Correction Network Coding in a Randomized Setting
- Quantum network coding utilizing quantum discord resource fully
- Flag codes of maximum distance and constructions using Singer groups
- Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes
- Energy effective congestion control for multicast with network coding in wireless ad hoc network
- Network information flow with correlated sources
- Deterministic bidirectional controlled remote preparation without information splitting
- Optimum distance flag codes from spreads via perfect matchings in graphs
- Almost affinely disjoint subspaces and covering Grassmannian codes
- Quantum network coding without loss of information
- Perfect quantum multiple-unicast network coding protocol
- Optimal Ferrers diagram rank-metric codes from MRD codes
- Bounds on the cardinality of subspace codes with non-maximum code distance
- A family of linear codes from constant dimension subspace codes
- Subspace packings: constructions and bounds
- Trade-off for heterogeneous distributed storage systems between storage and repair cost
- High-dimensional bidirectional controlled teleportation based on network coding
- New constructions of orbit codes based on the operations of orbit codes
- Properties of sets of subspaces with constant intersection dimension
- Complete simulation of automata networks
- Constructions of optimum distance full flag codes
- Information Flows in Complex Networks
- Zero-error network coding for acyclic networks
- Synchronizing Boolean networks asynchronously
- Fixed points and connections between positive and negative cycles in Boolean networks
- Linearly Homomorphic Signatures with Designated Entities
- Optimal-constrained multicast sub-graph over coded packet networks
- An efficient MAC scheme for secure network coding with probabilistic detection
- Information flow decomposition for network coding
- Intercluster connection in cognitive wireless mesh networks based on intelligent network coding
- Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates
- Decidability of well-connectedness for distributed synthesis
- A universal protocol for bidirectional controlled teleportation with network coding
- A new method for ensuring anonymity and security in network coding
- Anonymous coherent network coding against eavesdropping and jamming
- A computational perspective on network coding
- Matroidal structure of skew polynomial rings with application to network coding
- Duplex schemes in multiple antenna two-hop relaying
- Symbolic phase transfer entropy method and its application
- Minimum-energy wireless real-time multicast by joint network coding and scheduling optimization
- Bidirectional hybrid controlled quantum communication under noisy environment
- Equidistant subspace codes
- Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty
- Optimal scheduling of peer-to-peer file dissemination
- Controllable quantum network coding scheme based on quantum walk
- On the Langberg-Médard multiple unicast conjecture
- Quantum network code for multiple-unicast network with quantum invertible linear operations
- A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
- Flag codes from planar spreads in network coding
- A characterization of solvability for a class of networks
- Partial spreads in random network coding
- Reversible and Irreversible Information Networks
- Dualities Between Entropy Functions and Network Codes
- Shorter arithmetization of nondeterministic computations
- Competitive and deterministic embeddings of virtual networks
- Network coding for quantum cooperative multicast
- New constructions and bounds for Winkler's hat game
- Opportunistic quantum network coding based on quantum teleportation
- Distributed agreement in dynamic peer-to-peer networks
- Fair and distributed peer-to-peer allocation of a common, refillable resource
- Guessing games on triangle-free graphs
- On the extendability of particular classes of constant dimension codes
- On quantum network coding
- Algebraic codes for network coding
- Implementation of random linear network coding using nvidia's CUDA toolkit
- Complexity classification of network information flow problems
- Efficient coded-block delivery and caching in information-centric networking
- Towards efficient and practical network coding in delay tolerant networks
- Guessing numbers and extremal graph theory
- Robust entanglement distribution via quantum network coding
- Eisenberg-Gale markets: algorithms and game-theoretic properties
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- Generalizations and applications of the nowhere zero linear mappings in network coding
- On proper secrets, \((t,k)\)-bases and linear codes
- Performance analysis of network coding for multicast relay system over Nakagami-\(m\) fading channels
- The linear guessing number of undirected graphs
- A construction method of matroidal networks
- Scheduling with pairwise XORing of packets under statistical overhearing information and feedback
- Fixed points of Boolean networks, guessing graphs, and coding theory
- Information security in a random network coding network
- Network information flow
- The Missing Piece Syndrome in Peer-to-Peer Communication
- Finite dynamical systems, hat games, and coding theory
- Secure quantum network coding based on quantum homomorphic message authentication
- Interactive Communication, Diagnosis and Error Control in Networks
This page was built for publication: Network information flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501758)
