Network information flow
From MaRDI portal
DOI10.1109/18.850663zbMATH Open0991.90015OpenAlexW2105831729WikidataQ56699666 ScholiaQ56699666MaRDI QIDQ4501758FDOQ4501758
Authors: Ning Cai, Shuo-Yen Robert Li, Raymond W. Yeung, Rudolf Ahlswede 
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.850663
Recommendations
Communication theory (94A05) Source coding (94A29) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15) Network design and communication in computer systems (68M10)
Cites Work
- Network information flow
- Linear network coding
- Title not available (Why is that?)
- A Random Linear Network Coding Approach to Multicast
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Information theory and network coding
- Network error correction. I: Basic concepts and upper bounds
- Resilient Network Coding in the Presence of Byzantine Adversaries
- Byzantine Modification Detection in Multicast Networks With Random Network Coding
- Secure Network Coding on a Wiretap Network
- All-or-nothing encryption and the package transform
- Something about all or nothing (transforms)
- Polynomial Time Algorithms for Multicast Network Code Construction
- Linear Network Error Correction Codes in Packet Networks
- Signatures for network coding
Cited In (only showing first 100 items - show all)
- Competitive and deterministic embeddings of virtual networks
- Guessing numbers and extremal graph theory
- Rank-metric codes as ideals for subspace codes and their weight properties
- Partial spreads in random network coding
- Distributed agreement in dynamic peer-to-peer networks
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- 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
- Network coding for line networks with broadcast channels
- Exact decoding probability of random linear network coding for combinatorial networks
- How to construct strongly secure network coding scheme
- Network coding with modular lattices
- 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 flags
- Guessing games on triangle-free graphs
- On the extendability of particular classes of constant dimension codes
- Flag codes from planar spreads in network coding
- Flag codes: distance vectors and cardinality bounds
- Opportunistic quantum network coding based on quantum teleportation
- On quantum network coding
- The Missing Piece Syndrome in Peer-to-Peer Communication
- The maximum size of a partial spread in a finite projective space
- An effective genetic algorithm for network coding
- The linear guessing number of undirected graphs
- Fixed points of Boolean networks, guessing graphs, and coding theory
- Achieving net feedback gain in the linear-deterministic butterfly network with a full-duplex relay
- Structural routability of \(n\)-pairs information networks
- The value of side information in network flow optimization
- On proper secrets, \((t,k)\)-bases and linear codes
- Network routing capacity
- Dualities Between Entropy Functions and Network Codes
- Generalizations and applications of the nowhere zero linear mappings in network coding
- A cross-layer optimization framework for joint channel assignment and multicast routing in multi-channel multi-radio wireless mesh networks
- Polynomial Time Algorithms for Multicast Network Code Construction
- Eisenberg-Gale markets: algorithms and game-theoretic properties
- Secure quantum network coding for controlled repeater networks
- Memoryless computation: new results, constructions, and extensions
- Minimum-Cost Multicast over Coded Packet Networks
- Galois geometries and coding theory
- Complexity classification of network information flow problems
- Robust entanglement distribution via quantum network coding
- Performance analysis of network coding for multicast relay system over Nakagami-\(m\) fading channels
- Rank-metric codes and their applications
- A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
- Shorter arithmetization of nondeterministic computations
- Efficient coded-block delivery and caching in information-centric networking
- A construction method of matroidal networks
- A characterization of solvability for a class of networks
- Algebraic (trapdoor) one-way functions: constructions and applications
- Hypergraphs of multiparty secrets
- Scheduling with pairwise XORing of packets under statistical overhearing information and feedback
- Capacity factors in a point-to-point network
- How to make a linear network code (strongly) secure
- Implementation of random linear network coding using nvidia's CUDA toolkit
- Information security in a random network coding network
- Network information theory
- Reversible and Irreversible Information Networks
- New constructions and bounds for Winkler's hat game
- Network information flow
- 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
- Algebraic codes for network coding
- Linear network coding
- (Secure) linear network coding multicast
- Randomized and deterministic algorithms for network coding problems in wireless networks
- Cyclic orbit codes and stabilizer subfields
- Network coding for quantum cooperative multicast
- Reliability evaluation of a multicast over coded packet networks
- A robust optimization approach for multicast network coding under uncertain link costs
- Multi-partite entanglement can speed up quantum key distribution in networks
- Optimum distance flag codes from spreads via perfect matchings in graphs
- Equidistant subspace codes
- Constructions of optimum distance full flag codes
- Synchronizing Boolean networks asynchronously
- Controllable quantum network coding scheme based on quantum walk
- Universal secure rank-metric coding schemes with optimal communication overheads
- Optimal Ferrers diagram rank-metric codes from MRD codes
- High-dimensional bidirectional controlled teleportation based on network coding
- Complete simulation of automata networks
- Intercluster connection in cognitive wireless mesh networks based on intelligent network coding
- Optimal scheduling of peer-to-peer file dissemination
- 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
- 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
- Information flow decomposition for network coding
- Fixed points and connections between positive and negative cycles in Boolean networks
- Number of fixed points and disjoint cycles in monotone Boolean networks
- Linearly Homomorphic Signatures with Designated Entities
- Trade-off for heterogeneous distributed storage systems between storage and repair cost
- New constructions of orbit codes based on the operations of orbit codes
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)
