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

DOI10.3934/AMC.2016.10.95zbMATH Open1352.94021OpenAlexW2753664036MaRDI QIDQ259276FDOQ259276

Authors: Giuseppe Bianchi, Lorenzo Bracciale, Keren Censor-Hillel, Andrea Lincoln, 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

Recommendations

• The one-out-of-\(k\) retrieval problem and linear network coding
• Linear network coding
• A Random Linear Network Coding Approach to Multicast
• Network information flow
• (Secure) linear network coding multicast

zbMATH Keywords

lower boundsdelay tolerant networkfluid approximationslinear network codingmean field arguments

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Decentralized Erasure Codes for Distributed Networked Storage
• Title not available (Why is that?)
• Solutions of ordinary differential equations as limits of pure jump markov processes
• Differential equation approximations for Markov chains
• Limit theorems for discrete-time metapopulation models

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259276)