Structural Routability of n-Pairs Information Networks

DOI10.1007/978-3-319-02150-8_7zbMath1336.94006arXiv1108.6260OpenAlexW2135188867MaRDI QIDQ5497046

Girish N. Nair

Publication date: 30 January 2015

Published in: Information and Control in Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.6260

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Circuits, networks (94C99) Information theory (general) (94A15) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• Network routing capacity
• Insufficiency of Linear Coding in Network Information Flow
• Network information flow
• Linear network coding
• Multilevel diversity coding with distortion
• Multicasting Multiple Correlated Sources to Multiple Sinks Over a Noisy Channel Network
• On the capacity of information networks
• On the capacity of information networks

This page was built for publication: Structural Routability of n-Pairs Information Networks