Polynomial time algorithms for network information flow
- 7 June 2003
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 286-294
- https://doi.org/10.1145/777412.777464
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Beyond routing: an algebraic approach to network codingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Linear network codingIEEE Transactions on Information Theory, 2003
- Low complexity algebraic multicast network codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Finite field linear algebra subroutinesPublished by Association for Computing Machinery (ACM) ,2002
- Network information flowIEEE Transactions on Information Theory, 2000
- Randomized metarounding (extended abstract)Published by Association for Computing Machinery (ACM) ,2000
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- A method for computing addition tables inGF(p^n)(Corresp.)IEEE Transactions on Information Theory, 1980
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975