A characterization of solvability for a class of networks

DOI10.1007/S11432-011-4461-YMaRDI QIDQ439763zbMATH OpenOpenAlexFDO

Authors Chen Yuan, Haibin Kan

Publication date 17 August 2012

Published in Science China Information Sciences (Search for Journal in Brave)

Full work available at URL http://engine.scichina.com/doi/10.1007/s11432-011-4461-y

zbMATH Keywords

capacitysolvabilitynetwork codingcoding capacity

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Network design and communication in computer systems (68M10)

Recommendations

• Linearity and Solvability in Multicast Networks
• The solvability and monotonical properties of a certain class of D.C. non-linear networks
• Conditions for Petri net solvable binary words
• Topological conditions for the unique solvability of linear time-invariant and time-varying networks
• Unique solvability of linear memoryless networks-A survey

Cites work

• Complexity classification of network information flow problems
• Insufficiency of Linear Coding in Network Information Flow
• Linear network coding
• Linearity and Solvability in Multicast Networks
• Network information flow
• Unachievability of network coding capacity

Cited in

(6)

• On network models and the symbolic solution of network equations.
• Method of characteristic functions for classes of networks with fixed node degrees
• Construction of one special minimum storage regenerating code when α=2
• An axiomatic characterization of the position value for network situations
• A construction method of matroidal networks
• A characterization of network representable polymatroids

This page was built for publication: A characterization of solvability for a class of networks

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