Abstract
The MapReduce model of distributed computation accomplishes a task in three phases - two computation phases-Map and Reduce, with a communication phase - Shuffle, happening in between. This letter looks at the distributed communication problem in the shuffle phase with the assumption that the links through which the computing nodes exchange information is error-prone. Under this assumption, an optimal linear error-correcting transmission scheme is designed using index coding techniques.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
