Polynomial Time Algorithms for Multicast Network Code Construction

From MaRDI portal
Publication:3547060

DOI10.1109/TIT.2005.847712zbMath1288.94098MaRDI QIDQ3547060

No author found.

Publication date: 21 December 2008

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




Related Items

IMPACT OF TOPOLOGY ON THE MAXIMUM MULTICAST THROUGHPUT IN COMMUNICATION NETWORKS WITH NETWORK CODING, Induced weights on quotient modules and an application to error correction in coherent networks, Network encoding complexity: exact values, bounds, and inequalities, How to Construct Strongly Secure Network Coding Scheme, Generalizations and applications of the nowhere zero linear mappings in network coding, Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty, Galois geometries and coding theory, A computational perspective on network coding, Some applications of finite geometry for secure network coding, Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization, Exact decoding probability of random linear network coding for combinatorial networks, Reliability evaluation of a multicast over coded packet networks, How to make a linear network code (strongly) secure, A robust optimization approach for multicast network coding under uncertain link costs, Coding and control for communication networks, Randomized and deterministic algorithms for network coding problems in wireless networks, On proper secrets, \((t,k)\)-bases and linear codes, Multicast triangular semilattice network, Interactive Communication, Diagnosis and Error Control in Networks, Network information flow, Optimal-constrained multicast sub-graph over coded packet networks, Rank-Metric Codes and Their Applications