Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Network coding, does the model need tuning?

From MaRDI portal
Publication:2921706
Jump to:navigation, search

zbMATH Open1297.94015MaRDI QIDQ2921706FDOQ2921706


Authors: April Rasala Lehman, Eric Lehman Edit this on Wikidata


Publication date: 13 October 2014





Recommendations

  • Network coding
  • Network Coding: A Computational Perspective
  • The encoding complexity of network coding
  • Network Coding
  • Deterministic Network Model Revisited: An Algebraic Network Coding Approach
  • A computational perspective on network coding
  • Network Coding Capacity With a Constrained Number of Coding Nodes
  • On the Hardness of Approximating the Network Coding Capacity


Mathematics Subject Classification ID

Communication theory (94A05) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)



Cited In (3)

  • Unachievability of network coding capacity
  • Linear-code multicast on parallel architectures
  • Monotonicity testing and shortest-path routing on the cube





This page was built for publication: Network coding, does the model need tuning?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921706)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2921706&oldid=15891839"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 20:13. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki