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)- On Field Size and Success Probability in Network Coding
- Competitive and deterministic embeddings of virtual networks
- Optimum distance flag codes from spreads via perfect matchings in graphs
- Guessing numbers and extremal graph theory
- Diffusion and consensus on weakly connected directed graphs
- Equidistant subspace codes
- Rank-metric codes as ideals for subspace codes and their weight properties
- Opinion dynamics under double thresholds
- Codes for Distributed Storage
- Multi-partite entanglement can speed up quantum key distribution in networks
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- Partial spreads in random network coding
- Distributed agreement in dynamic peer-to-peer networks
- A study of the performance of novel storage-centric repairable codes
- The one-out-of-\(k\) retrieval problem and linear network coding
- Efficient quantum information processing via quantum compressions
- Distributed synthesis for well-connected architectures
- Constructions of optimum distance full flag codes
- Synchronizing Boolean networks asynchronously
- Single-Sink Multicommodity Flow with Side Constraints
- Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization
- Network coding for line networks with broadcast channels
- Controllable quantum network coding scheme based on quantum walk
- Universal secure rank-metric coding schemes with optimal communication overheads
- Intercluster connection in cognitive wireless mesh networks based on intelligent network coding
- High-dimensional bidirectional controlled teleportation based on network coding
- Complete simulation of automata networks
- Maximum flag-rank distance codes
- Optimal scheduling of peer-to-peer file dissemination
- Exact decoding probability of random linear network coding for combinatorial networks
- Optimal Ferrers diagram rank-metric codes from MRD codes
- How to construct strongly secure network coding scheme
- Fair and distributed peer-to-peer allocation of a common, refillable resource
- Towards efficient and practical network coding in delay tolerant networks
- Network coding with modular lattices
- Network coding with flags
- Theory behind quantum error correcting codes: an overview
- Guessing games on triangle-free graphs
- On the extendability of particular classes of constant dimension codes
- A characterization of cyclic subspace codes via subspace polynomials
- Quantum network coding utilizing quantum discord resource fully
- Deterministic bidirectional controlled remote preparation without information splitting
- Quantum network coding without loss of information
- Bounds on subspace codes based on orthogonal space over finite fields of characteristic 2
- Anonymous coherent network coding against eavesdropping and jamming
- Symbolic phase transfer entropy method and its application
- Bidirectional hybrid controlled quantum communication under noisy environment
- Improved syndrome decoding of lifted L-interleaved Gabidulin codes
- A family of linear codes from constant dimension subspace codes
- Abelian non-cyclic orbit codes and multishot subspace codes
- Information flow decomposition for network coding
- Flag codes from planar spreads in network coding
- Cyclic orbit flag codes
- Fixed points and connections between positive and negative cycles in Boolean networks
- On networks of two-way channels
- Bounds on subspace codes based on subspaces of type (s,0,0,0) in pseudo-symplectic spaces and singular pseudo-symplectic spaces
- Opportunistic quantum network coding based on quantum teleportation
- Fast decoding of lifted interleaved linearized Reed-Solomon codes for multishot network coding
- On the minimum depth of circuits with linear number of wires encoding good codes
- Flag codes: distance vectors and cardinality bounds
- Network coding in undirected graphs is either very helpful or not helpful at all
- Number of fixed points and disjoint cycles in monotone Boolean networks
- Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space
- On quantum network coding
- The maximum size of a partial spread in a finite projective space
- The Missing Piece Syndrome in Peer-to-Peer Communication
- Linearly Homomorphic Signatures with Designated Entities
- Continuous-variable quantum network coding for coherent states
- Constructions of rank metric codes under actions of the unitary groups
- 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
- An efficient MAC scheme for secure network coding with probabilistic detection
- An effective genetic algorithm for network coding
- Linear index coding via semidefinite programming
- The linear guessing number of undirected graphs
- Optimal-constrained multicast sub-graph over coded packet networks
- A new method for ensuring anonymity and security in network coding
- Matrix games in the multicast networks: maximum information flows with network switching.
- The value of side information in network flow optimization
- Decidability of well-connectedness for distributed synthesis
- Von Staudt constructions for skew-linear and multilinear matroids
- Fixed points of Boolean networks, guessing graphs, and coding theory
- On proper secrets, (t,k)-bases and linear codes
- Achieving net feedback gain in the linear-deterministic butterfly network with a full-duplex relay
- Structural routability of \(n\)-pairs information networks
- OPEC or a basic problem in source networks
- Network routing capacity
- Polynomial time algorithm for min-ranks of graphs with simple tree structures
- The one-out-of-\(k\) retrieval problem and linear network coding
- Attractor separation and signed cycles in asynchronous Boolean networks
- Perfect quantum multiple-unicast network coding protocol
- One-adhesive polymatroids.
- Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty
- scientific article; zbMATH DE number 7310275 (Why is no real title available?)
- The serializability of network codes
- New constructions of orbit codes based on imprimitive wreath products and wreathed tensor products
- Generalizations and applications of the nowhere zero linear mappings in network coding
- Dualities Between Entropy Functions and Network Codes
- Coding and control for communication 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)
