A construction method of matroidal networks

DOI10.1007/s11432-011-4373-xzbMath1270.68041OpenAlexW2264615359MaRDI QIDQ362156

Haibin Kan, Chen Yuan, Xin Wang, Hiroshi Imai

Publication date: 20 August 2013

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-4373-x

zbMATH Keywords

capacitymatroidnetwork codingmatroidal network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

Construction of one special minimum storage regenerating code when α=2

Cites Work

• A characterization of solvability for a class of networks
• Network routing capacity
• Networks, Matroids, and Non-Shannon Information Inequalities
• Network information flow
• Linear network coding
• On characterization of entropy function via information inequalities
• Unnamed Item

This page was built for publication: A construction method of matroidal networks