Pages that link to "Item:Q908052"
From MaRDI portal
The following pages link to (Secure) linear network coding multicast (Q908052):
Displaying 11 items.
- The one-out-of-\(k\) retrieval problem and linear network coding (Q259276) (← links)
- Linear-code multicast on parallel architectures (Q427139) (← links)
- How to make a linear network code (strongly) secure (Q510412) (← links)
- A robust optimization approach for multicast network coding under uncertain link costs (Q526429) (← links)
- Generalizations and applications of the nowhere zero linear mappings in network coding (Q616419) (← links)
- Algebraic codes for network coding (Q2269364) (← links)
- Multicast triangular semilattice network (Q2292588) (← links)
- Linear provable security for a class of unbalanced Feistel network (Q2501420) (← links)
- A Random Linear Network Coding Approach to Multicast (Q3548184) (← links)
- On Secure Network Coding for Multiple Unicast Traffic (Q5124497) (← links)
- Almost affinely disjoint subspaces and covering Grassmannian codes (Q6063245) (← links)