Pages that link to "Item:Q3548184"
From MaRDI portal
The following pages link to A Random Linear Network Coding Approach to Multicast (Q3548184):
Displaying 11 items.
- Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture (Q5009787) (← links)
- Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2 (Q5205027) (← links)
- A Note on Optimal Constant Dimension Codes (Q5250281) (← links)
- Subspace codes from Ferrers diagrams (Q5272572) (← links)
- An Asymptotically Optimal Push–Pull Method for Multicasting Over a Random Network (Q5346432) (← links)
- Violations of the Ingleton inequality and revising the four-atom conjecture (Q5858542) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- Codes in the Sum-Rank Metric: Fundamentals and Applications (Q5863766) (← links)
- Almost affinely disjoint subspaces and covering Grassmannian codes (Q6063245) (← links)
- Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty (Q6176403) (← links)
- Some new constructions of optimal and almost optimal locally repairable codes (Q6655742) (← links)