Network information flow

DOI10.1109/18.850663zbMath0991.90015OpenAlexW2105831729WikidataQ56699666 ScholiaQ56699666MaRDI QIDQ4501758

Raymond W. Yeung, Shuo-Yen Robert Li, Ning Cai, 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

zbMATH Keywords

switching multicast network coding diversity coding multiterminal source coding

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Applications of graph theory to circuits and networks (94C15) Communication theory (94A05) Source coding (94A29)

Related Items

Von Staudt constructions for skew-linear and multilinear matroids, Linearly Homomorphic Signatures with Designated Entities, Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory, DD-POR: Dynamic Operations and Direct Repair in Network Coding-Based Proof of Retrievability, Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks, Finite Dynamical Systems, Hat Games, and Coding Theory, How to Construct Strongly Secure Network Coding Scheme, Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks, A universal protocol for bidirectional controlled teleportation with network coding, Quantum channels over graph states using generalized measurement-based quantum computation framework, Quantum network coding utilizing quantum discord resource fully, Broadcast Transmission to Prioritizing Receivers, Almost affinely disjoint subspaces and covering Grassmannian codes, Optimal Ferrers diagram rank-metric codes from MRD codes, Synchronizing Boolean networks asynchronously, Deterministic bidirectional controlled remote preparation without information splitting, Attractor separation and signed cycles in asynchronous Boolean networks, Theory behind quantum error correcting codes: an overview, Constructions of optimum distance full flag codes, Quantum network coding without loss of information, Multi-partite entanglement can speed up quantum key distribution in networks, Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty, New constructions of orbit codes based on imprimitive wreath products and wreathed tensor products, Unnamed Item, On Field Size and Success Probability in Network Coding, Representability of matroids by \(c\)-arrangements is undecidable, Single-Sink Multicommodity Flow with Side Constraints, Unnamed Item, Some applications of finite geometry for secure network coding, Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization, Exact decoding probability of random linear network coding for combinatorial networks, Secure multi-source network coding scheme with lattice signature, The minrank of random graphs, Subspace code based on flats in affine space over finite fields, Lower Bounds for External Memory Integer Sorting via Network Coding, Linear Index Coding via Semidefinite Programming, Implementation of Random Linear Network Coding Using NVIDIA’s CUDA Toolkit, Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay, Bounds on subspace codes based on totally isotropic subspace in symplectic spaces and extended symplectic spaces, On describing the routing capacity regions of networks, Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2, Secure Error-Correction Network Coding in a Randomized Setting, Interactive Communication, Diagnosis and Error Control in Networks, A cross-layer optimization framework for joint channel assignment and multicast routing in multi-channel multi-radio wireless mesh networks, Network coding in undirected graphs is either very helpful or not helpful at all, The Missing Piece Syndrome in Peer-to-Peer Communication, Structural Routability of n-Pairs Information Networks, NETWORK CODING WITH MODULAR LATTICES, Unnamed Item, Robust entanglement distribution via quantum network coding, New Constructions and Bounds for Winkler's Hat Game, One-adhesive polymatroids, Violations of the Ingleton inequality and revising the four-atom conjecture, Unnamed Item, Unnamed Item, Network information flow, On quantum network coding, Rank-Metric Codes and Their Applications, Codes for Distributed Storage, Codes in the Sum-Rank Metric: Fundamentals and Applications, Efficient quantum information processing via quantum compressions, Flag codes of maximum distance and constructions using Singer groups, Optimum distance flag codes from spreads via perfect matchings in graphs, Matroidal structure of skew polynomial rings with application to network coding, Guessing games on triangle-free graphs, On the extendability of particular classes of constant dimension codes, On fast and robust information spreading in the vertex-congest model, Constructions of rank metric codes under actions of the unitary groups, Opportunistic quantum network coding based on quantum teleportation, Optimal scheduling of peer-to-peer file dissemination, Distributed synthesis for well-connected architectures, Partial spreads in random network coding, Guessing numbers and extremal graph theory, Secure quantum network coding for controlled repeater networks, Perfect quantum multiple-unicast network coding protocol, Performance analysis of network coding for multicast relay system over Nakagami-\(m\) fading channels, A construction method of matroidal networks, Minimum-energy wireless real-time multicast by joint network coding and scheduling optimization, The maximum size of a partial spread in a finite projective space, Linear cutting blocking sets and minimal codes in the rank metric, Scheduling with pairwise XORing of packets under statistical overhearing information and feedback, Information security in a random network coding network, Continuous-variable quantum network coding for coherent states, On the Langberg-Médard multiple unicast conjecture, Competitive and deterministic embeddings of virtual networks, Generalizations and applications of the nowhere zero linear mappings in network coding, Max-flow min-cut theorems on dispersion and entropy measures for communication networks, List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques, A complete characterization of irreducible cyclic orbit codes and their Plücker embedding, A characterization of cyclic subspace codes via subspace polynomials, Fair and distributed peer-to-peer allocation of a common, refillable resource, Network coding for quantum cooperative multicast, Equidistant subspace codes, Decidability of well-connectedness for distributed synthesis, Towards efficient and practical network coding in delay tolerant networks, Network coding with flags, Subspace packings: constructions and bounds, Fixing monotone Boolean networks asynchronously, (Secure) linear network coding multicast, Galois geometries and coding theory, A characterization of solvability for a class of 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, Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory, Abelian non-cyclic orbit codes and multishot subspace codes, A computational perspective on network coding, Energy effective congestion control for multicast with network coding in wireless ad hoc network, The linear guessing number of undirected graphs, Hypergraphs of multiparty secrets, Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes, Memoryless computation: new results, constructions, and extensions, Universal secure rank-metric coding schemes with optimal communication overheads, Duplex schemes in multiple antenna two-hop relaying, Cyclic orbit flag codes, Secure quantum network coding based on quantum homomorphic message authentication, Shorter arithmetization of nondeterministic computations, Algebraic (trapdoor) one-way functions: constructions and applications, Anonymous coherent network coding against eavesdropping and jamming, Reliability evaluation of a multicast over coded packet networks, Controllable quantum network coding scheme based on quantum walk, Capacity factors in a point-to-point network, How to make a linear network code (strongly) secure, 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, Fixed points and connections between positive and negative cycles in Boolean networks, Flag codes from planar spreads in network coding, A robust optimization approach for multicast network coding under uncertain link costs, An effective genetic algorithm for network coding, An efficient MAC scheme for secure network coding with probabilistic detection, Intercluster connection in cognitive wireless mesh networks based on intelligent network coding, Polynomial time algorithm for min-ranks of graphs with simple tree structures, Symbolic phase transfer entropy method and its application, Bidirectional hybrid controlled quantum communication under noisy environment, Algebraic codes for network coding, Coding and control for communication networks, 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, Eisenberg-Gale markets: algorithms and game-theoretic properties, Randomized and deterministic algorithms for network coding problems in wireless networks, On proper secrets, \((t,k)\)-bases and linear codes, 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, 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, Diffusion and consensus on weakly connected directed graphs, A construction of abelian non-cyclic orbit codes, Efficient coded-block delivery and caching in information-centric networking, Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space, Flag codes: distance vectors and cardinality bounds, Optimal-constrained multicast sub-graph over coded packet networks, Cyclic orbit codes and stabilizer subfields, High-dimensional bidirectional controlled teleportation based on network coding, Distributed agreement in dynamic peer-to-peer networks, A study of the performance of novel storage-centric repairable codes, A new method for ensuring anonymity and security in network coding

Cites Work