z-logo
open-access-imgOpen Access
The one-out-of-k retrieval problem and linear network coding
Author(s) -
Giuseppe Bianchi,
Lorenzo Bracciale,
Keren Censor-Hillel,
Andrea Lincoln,
Muriel Médard
Publication year - 2016
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2016.10.95
Subject(s) - linear network coding , mathematics , coding (social sciences) , upper and lower bounds , theoretical computer science , scheme (mathematics) , computer science , algorithm , discrete mathematics , statistics , computer network , network packet , mathematical analysis

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom