Recommendations
Cites work
- 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
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Information theory and network coding
- Linear network coding
- Linear Network Error Correction Codes in Packet Networks
- 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)- Perfect quantum multiple-unicast network coding protocol
- Minimum-energy wireless real-time multicast by joint network coding and scheduling optimization
- On the Langberg-Médard multiple unicast conjecture
- Network coding with flags
- Energy effective congestion control for multicast with network coding in wireless ad hoc network
- Improved syndrome decoding of lifted L-interleaved Gabidulin codes
- Universal secure rank-metric coding schemes with optimal communication overheads
- Anonymous coherent network coding against eavesdropping and jamming
- Reliability evaluation of a multicast over coded packet networks
- Fixed points and connections between positive and negative cycles in Boolean networks
- An effective genetic algorithm for network coding
- An efficient MAC scheme for secure network coding with probabilistic detection
- A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
- Decidability of well-connectedness for distributed synthesis
- 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
- A computational perspective on network coding
- Flag codes from planar spreads in network coding
- Symbolic phase transfer entropy method and its application
- Bidirectional hybrid controlled quantum communication under noisy environment
- Trade-off for heterogeneous distributed storage systems between storage and repair cost
- New constructions of orbit codes based on the operations of orbit codes
- Properties of sets of subspaces with constant intersection dimension
- A family of linear codes from constant dimension subspace codes
- Bounds on the cardinality of subspace codes with non-maximum code distance
- Orbit codes from forms on vector spaces over a finite field
- Flag codes: distance vectors and cardinality bounds
- High-dimensional bidirectional controlled teleportation based on network coding
- Flag codes of maximum distance and constructions using Singer groups
- Constructions of rank metric codes under actions of the unitary groups
- Guessing numbers and extremal graph theory
- Linear cutting blocking sets and minimal codes in the rank metric
- Subspace packings: constructions and bounds
- Fixing monotone Boolean networks asynchronously
- Abelian non-cyclic orbit codes and multishot subspace codes
- Cyclic orbit flag codes
- Controllable quantum network coding scheme based on quantum walk
- Bounds on subspace codes based on subspaces of type (s,0,0,0) in pseudo-symplectic spaces and singular pseudo-symplectic spaces
- Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates
- Polynomial time algorithm for min-ranks of graphs with simple tree structures
- Algebraic codes for network coding
- Coding and control for communication networks
- Multicast triangular semilattice network
- Rank-metric codes as ideals for subspace codes and their weight properties
- Tripartite layered quantum key distribution scheme with a symmetrical key structure
- Complete simulation of automata networks
- Several kinds of large cyclic subspace codes via Sidon spaces
- Diffusion and consensus on weakly connected directed graphs
- A construction of abelian non-cyclic orbit codes
- Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space
- Optimal-constrained multicast sub-graph over coded packet networks
- Cyclic orbit codes and stabilizer subfields
- Distributed agreement in dynamic peer-to-peer networks
- A new method for ensuring anonymity and security in network coding
- Matroidal structure of skew polynomial rings with application to network coding
- The maximum size of a partial spread in a finite projective space
- Continuous-variable quantum network coding for coherent states
- Max-flow min-cut theorems on dispersion and entropy measures for communication networks
- A characterization of cyclic subspace codes via subspace polynomials
- Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory
- The linear guessing number of undirected graphs
- Randomized and deterministic algorithms for network coding problems in wireless networks
- A study of the performance of novel storage-centric repairable codes
- The one-out-of-\(k\) retrieval problem and linear network coding
- Partial spreads in random network coding
- Efficient quantum information processing via quantum compressions
- Quantum channels over graph states using generalized measurement-based quantum computation framework
- Quantum network coding utilizing quantum discord resource fully
- Deterministic bidirectional controlled remote preparation without information splitting
- Attractor separation and signed cycles in asynchronous Boolean networks
- Quantum network coding without loss of information
- Representability of matroids by c-arrangements is undecidable
- Guessing games on triangle-free graphs
- On the extendability of particular classes of constant dimension codes
- Opportunistic quantum network coding based on quantum teleportation
- How to construct strongly secure network coding scheme
- Single-Sink Multicommodity Flow with Side Constraints
- Exact decoding probability of random linear network coding for combinatorial networks
- Secure multi-source network coding scheme with lattice signature
- Network information theory
- Network coding with modular lattices
- scientific article; zbMATH DE number 2127867 (Why is no real title available?)
- DD-POR: dynamic operations and direct repair in network coding-based proof of retrievability
- Secure quantum network coding for controlled repeater networks
- OPEC or a basic problem in source networks
- On networks of two-way channels
- Fixed points of Boolean networks, guessing graphs, and coding theory
- The one-out-of-\(k\) retrieval problem and linear network coding
- Performance analysis of network coding for multicast relay system over Nakagami-m fading channels
- On Field Size and Success Probability in Network Coding
- Some applications of finite geometry for secure network coding
- Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization
- Network information flow with correlated sources
- Network routing capacity
- Information flow decomposition for network coding
- Towards an information theory of large networks: an achievable rate region
- Polynomial Time Algorithms for Multicast Network Code Construction
- Matrix games in the multicast networks: maximum information flows with network switching.
- Minimum-Cost Multicast over Coded Packet Networks
- Zero-error network coding for acyclic 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)
