Multicasting in Linear Deterministic Relay Network by Matrix Completion

DOI10.1109/TIT.2015.2509240MaRDI QIDQ2977009zbMATH OpenOpenAlexFDO

Authors Tasuku Soma

Publication date 28 April 2017

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

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

Mathematics Subject Classification ID

Applications of design theory to circuits and networks (94C30)

Recommendations

• Multisource Transmission for Wireless Relay Networks With Linear Complexity
• Linearity and Solvability in Multicast Networks
• Deterministic network coding by matrix completion
• A Random Linear Network Coding Approach to Multicast
• The multicast capacity of deterministic relay networks with no interference.
• A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks
• MIMO Relaying With Linear Processing for Multiuser Transmission in Fixed Relay Networks
• Capacity of a Class of Linear Binary Field Multisource Relay Networks
• Stable Throughput for Multicast With Random Linear Coding
• scientific article; zbMATH DE number 975322

Cited in

(1)

• scientific article; zbMATH DE number 1532270 (Why is no real title available?)

This page was built for publication: Multicasting in Linear Deterministic Relay Network by Matrix Completion

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