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

DOI10.3934/AMC.2016.10.95MaRDI QIDQ259276zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 5454271 (Why is no real title available?)
• scientific article; zbMATH DE number 43706 (Why is no real title available?)
• Decentralized Erasure Codes for Distributed Networked Storage
• Differential equation approximations for Markov chains
• Limit theorems for discrete-time metapopulation models
• Solutions of ordinary differential equations as limits of pure jump markov processes

Cited in

(1)

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

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)