The one-out-of-\(k\) retrieval problem and linear network coding

DOI10.3934/AMC.2016.10.95zbMath1352.94021OpenAlexW2753664036MaRDI 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

zbMATH Keywords

lower boundsdelay tolerant networkfluid approximationslinear network codingmean field arguments

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Dynamical systems in optimization and economics (37N40) Source coding (94A29)

Cites Work

• Differential equation approximations for Markov chains
• Limit theorems for discrete-time metapopulation models
• Decentralized Erasure Codes for Distributed Networked Storage
• Solutions of ordinary differential equations as limits of pure jump markov processes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The one-out-of-\(k\) retrieval problem and linear network coding