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)
- 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
- 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
- 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
- On fast and robust information spreading in the vertex-congest model
- 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
- Properties of sets of subspaces with constant intersection dimension
- An efficient MAC scheme for secure network coding with probabilistic detection
- Optimal-constrained multicast sub-graph over coded packet networks
- A new method for ensuring anonymity and security in network coding
- Decidability of well-connectedness for distributed synthesis
- Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty
- Attractor separation and signed cycles in asynchronous Boolean networks
- Perfect quantum multiple-unicast network coding protocol
- Asynchronous simulation of Boolean networks by monotone Boolean networks
- Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory
- Linear cutting blocking sets and minimal codes in the rank metric
- Matroidal structure of skew polynomial rings with application to network coding
- Minimum-energy wireless real-time multicast by joint network coding and scheduling optimization
- Energy effective congestion control for multicast with network coding in wireless ad hoc network
- Almost affinely disjoint subspaces and covering Grassmannian codes
- Secure Error-Correction Network Coding in a Randomized Setting
- On the Langberg-Médard multiple unicast conjecture
- A universal protocol for bidirectional controlled teleportation with network coding
- A construction of abelian non-cyclic orbit codes
- Network information flow with correlated sources
- Several kinds of large cyclic subspace codes via Sidon spaces
- Orbit codes from forms on vector spaces over a finite field
- Zero-error network coding for acyclic networks
- 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
- Towards robust and efficient computation in dynamic peer-to-peer networks
- Bounds on the cardinality of subspace codes with non-maximum code distance
- A computational perspective on network coding
- Duplex schemes in multiple antenna two-hop relaying
- Subspace packings: constructions and bounds
- The minrank of random graphs
- Quantum network code for multiple-unicast network with quantum invertible linear operations
- Information Flows in Complex Networks
- Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates
- Flag codes of maximum distance and constructions using Singer groups
- 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
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)
