Reversible and Irreversible Information Networks

DOI10.1109/TIT.2007.907345MaRDI QIDQ3548899zbMATH OpenOpenAlexFDO

Authors Søren Riis

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2007.907345

Mathematics Subject Classification ID

Path integrals in quantum mechanics (81S40) Information theory (general) (94A15) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks
• Network information flow
• Complexity classification of network information flow problems
• On the capacity of information networks
• Linear network coding

Cited in

(9)

• On the guessing number of shift graphs
• Information criteria for quantifying loss of reversibility in parallelized KMC
• The linear guessing number of undirected graphs
• Guessing games on triangle-free graphs
• scientific article; zbMATH DE number 5595793 (Why is no real title available?)
• Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks
• Finite dynamical systems, hat games, and coding theory
• Reversibility and stochastic networks
• Topological reversibility and causality in feed-forward networks

This page was built for publication: Reversible and Irreversible Information Networks

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