Pages that link to "Item:Q5281388"
From MaRDI portal
The following pages link to On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory (Q5281388):
Displaying 15 items.
- Secret-sharing matroids need not be algebraic (Q284751) (← links)
- Covering cycle matroid (Q469837) (← links)
- The truncated and supplemented Pascal matrix and applications (Q1684516) (← links)
- Polynomial time algorithm for min-ranks of graphs with simple tree structures (Q2258079) (← links)
- Representability of matroids by \(c\)-arrangements is undecidable (Q2696633) (← links)
- The free product of M-fuzzifying matroids1 (Q2988582) (← links)
- Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory (Q3455244) (← links)
- Finite Dynamical Systems, Hat Games, and Coding Theory (Q4578011) (← links)
- Capacity Theorems for Distributed Index Coding (Q5124455) (← links)
- The Edge-Removal Problem’s Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding (Q5211641) (← links)
- Bounding the Optimal Rate of the ICSI and ICCSI problem (Q5275436) (← links)
- Sheaf cohomology on network codings: maxflow-mincut theorem (Q5369041) (← links)
- (Q5743408) (← links)
- Von Staudt constructions for skew-linear and multilinear matroids (Q5886256) (← links)
- Parametric matroid interdiction (Q6122085) (← links)
