# Linearity and solvability in multicast networks

@article{Dougherty2004LinearityAS, title={Linearity and solvability in multicast networks}, author={Randall Dougherty and Christopher F. Freiling and Kenneth Zeger}, journal={IEEE Transactions on Information Theory}, year={2004}, volume={50}, pages={2243-2256} }

- Published 2004 in IEEE Transactions on Information Theory
DOI:10.1109/TIT.2004.834751

It is known that for every solvable multicast network, there exists a large enough finite-field alphabet such that a scalar linear solution exists. We prove: i) every binary solvable multicast network with at most two messages has a binary scalar linear solution; ii) for more than two messages, not every binary solvable multicast network has a binary scalar linear solution; iii) a multicast network that has a solution for a given alphabet might not have a solution for all larger alphabets.Â

Highly Cited

This paper has 107 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

49 Citations

17 References

Similar Papers

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 108 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**108**citations based on the available data.See our **FAQ** for additional information.