On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
From MaRDI portal
Publication:5281388
DOI10.1109/TIT.2010.2048502zbMath1366.94587OpenAlexW2171844485MaRDI QIDQ5281388
Costas N. Georghiades, Alex Sprintson, Salim El Rouayheb
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2010.2048502
Linear codes (general theory) (94B05) Combinatorial aspects of matroids and geometric lattices (05B35) Applications of graph theory to circuits and networks (94C15) Source coding (94A29)
Related Items (12)
Bounding the Optimal Rate of the ICSI and ICCSI problem ⋮ Von Staudt constructions for skew-linear and multilinear matroids ⋮ Secret-sharing matroids need not be algebraic ⋮ Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory ⋮ Finite Dynamical Systems, Hat Games, and Coding Theory ⋮ The truncated and supplemented Pascal matrix and applications ⋮ Parametric matroid interdiction ⋮ Representability of matroids by \(c\)-arrangements is undecidable ⋮ The free product of M-fuzzifying matroids1 ⋮ Covering cycle matroid ⋮ Polynomial time algorithm for min-ranks of graphs with simple tree structures ⋮ Unnamed Item
This page was built for publication: On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
