A characterization of solvability for a class of networks

DOI10.1007/S11432-011-4461-YzbMath1245.68023OpenAlexW2090929931MaRDI QIDQ439763

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

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

Related Items (2)

Construction of one special minimum storage regenerating code when α=2 ⋮ A construction method of matroidal networks

Cites Work

• Linearity and Solvability in Multicast Networks
• Insufficiency of Linear Coding in Network Information Flow
• Network information flow
• Linear network coding
• Unnamed Item
• Unnamed Item

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