Published in

Institute of Electrical and Electronics Engineers, IEEE Transactions on Information Theory, 12(64), p. 7557-7576, 2018

DOI: 10.1109/tit.2018.2865750

Links

Tools

Export citation

Search in Google Scholar

Communication Cost for Updating Linear Functions when Message Updates are Sparse: Connections to Maximally Recoverable Codes

Journal article published in 2016 by N. Prakash ORCID, Muriel Medard
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO