Coding for Distributed Storage

Speaker:  Prof.  Zhiying Wang

Electrical Engineering and Computer Science

The Henry Samueli School of Engineering

University of California, Irvine

Date:   Wednesday, Feb 8th, 2017

Time:     

Social Hour:  6:00 p.m.

Dinner:          6:30 p.m.

Presentation: 7:15 p.m.

Location: 

The Doubletree Club Orange County Airport

7 Hutton Centre Drive,

Santa Ana, CA, 92707-5794

714-751-2400

Please RSVP at http://oc-comsig.eventbrite.com/

Cost:  First 10 early-birds (first-come-first-serve) are free! After that, $20 for non-members with dinner, $10 for IEEE members with dinner, $5 for student-members with dinner, free for presentation only

For more information on current and future events, please visit Orange County ComSig chapter website at: http://chapters.comsoc.org/comsig/

Abstract:

Error correction codes (ECC) are ubiquitously used in data storage to provide fault tolerance. Traditionally, redundancy and error tolerance capability are considered the key performance measures for ECC. In distributed storage, however, codes need to be developed for the new challenges brought by the networked nature of the system. In this talk, we present regenerating codes, a family of codes that are efficient for failure correction.  For systems with 2 redundant storage devices, the repair bandwidth can be reduced by 1/2 compared to traditional ECC.

Speaker Biography:

Zhiying Wang is an Assistant Professor at University of California, Irvine. She was a postdoctoral research fellow at Stanford University. She received Ph.D. and M.S. in Electrical Engineering at California Institute of Technology, and B.S. in Information and Electronic Engineering at Tsinghua University. Her research interests include information theory, coding for data storage, and compression for genomic information. She is the recipient of IEEE data storage best paper award and NSF Center for Science of Information Postdoctoral Fellowship.

Questions:  

Dr. Lan Nguyen

IEEE OC ComSig Chapter Chair

lan.nguyen@linquest.com