Representations of the multicast network problem
From MaRDI portal
Abstract: We approach the problem of linear network coding for multicast networks from different perspectives. We introduce the notion of the coding points of a network, which are edges of the network where messages combine and coding occurs. We give an integer linear program that leads to choices of paths through the network that minimize the number of coding points. We introduce the code graph of a network, a simplified directed graph that maintains the information essential to understanding the coding properties of the network. One of the main problems in network coding is to understand when the capacity of a multicast network is achieved with linear network coding over a finite field of size q. We explain how this problem can be interpreted in terms of rational points on certain algebraic varieties.
Recommendations
Cited in
(9)- Random network coding over composite fields
- Multicast triangular semilattice network
- The do-all problem in broadcast networks
- Linearity and Solvability in Multicast Networks
- Concurrent multicast in weighted networks
- ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS
- Generalizations and applications of the nowhere zero linear mappings in network coding
- External codes for multiple unicast networks via interference alignment
- (Secure) linear network coding multicast
This page was built for publication: Representations of the multicast network problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742156)