Polynomial Time Algorithms for Multicast Network Code Construction
From MaRDI portal
Recommendations
Cited in
(34)- Induced weights on quotient modules and an application to error correction in coherent networks
- Reliability evaluation of a multicast over coded packet networks
- A computational perspective on network coding
- Coding and control for communication networks
- Multicast triangular semilattice network
- Optimal-constrained multicast sub-graph over coded packet networks
- Network encoding complexity: exact values, bounds, and inequalities
- Max-flow min-cut theorems on dispersion and entropy measures for communication networks
- Randomized and deterministic algorithms for network coding problems in wireless networks
- Deterministic network coding by matrix completion
- How to construct strongly secure network coding scheme
- Exact decoding probability of random linear network coding for combinatorial networks
- scientific article; zbMATH DE number 2127867 (Why is no real title available?)
- Impact of topology on the maximum multicast throughput in communication networks with network coding
- Polynomial-Time Construction of Linear Network Coding
- Some applications of finite geometry for secure network coding
- Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization
- Matrix games in the multicast networks: maximum information flows with network switching.
- Zero-error network coding for acyclic networks
- The serializability of network codes
- Interactive Communication, Diagnosis and Error Control in Networks
- Network information flow
- Revisiting the linear information flow algorithm
- How to make a linear network code (strongly) secure
- A robust optimization approach for multicast network coding under uncertain link costs
- Improved Jaggi-Sanders algorithms for constructing linear broadcast and linear dispersion network coding
- A MAX-Flow/MIN-Cut algorithm for a class of wireless networks
- Complexity classification of network information flow problems
- Rank-metric codes and their applications
- Generalizations and applications of the nowhere zero linear mappings in network coding
- Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty
- An optimal binary linear functional-repair storage code with efficient repair related to \(\mathrm{PG}(2,8)\)
- On proper secrets, (t,k)-bases and linear codes
- Galois geometries and coding theory
This page was built for publication: Polynomial Time Algorithms for Multicast Network Code Construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547060)
