The one-out-of-\(k\) retrieval problem and linear network coding
From MaRDI portal
Publication:259276
DOI10.3934/amc.2016.10.95zbMath1352.94021MaRDI QIDQ259276
Andrea Lincoln, Lorenzo Bracciale, Keren Censor-Hillel, Giuseppe Bianchi, Muriel Médard
Publication date: 11 March 2016
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2016.10.95
lower bounds; delay tolerant network; fluid approximations; linear network coding; mean field arguments
90B15: Stochastic network models in operations research
37N40: Dynamical systems in optimization and economics
94A29: Source coding
Cites Work