报告人： Prof. Alexander Barg 美国马里兰大学(UniversityofMaryland) 报告时间:2017年4月21日(周五)下午15:00 报告地点: 维格堂113
报告摘要: Widespread use of distributed storage systems has given rise to new problems in coding theory related to efficient and reliable encoding of the stored data. One such group of problems studies codes in which one erased coordinate of the codeword can be recovered from a small number of other coordinates (such codes are said to satisfy the locality constraint). In the first part of the talk, we present algebraic constructions of codes with locality, including a family of Reed-Solomon type codes and their extension to codes on algebraic curves.
The second group of problems addresses recovery of the lost data by transmitting the smallest possible amount of information from the other coordinates of the codeword (the repair bandwidth). We present algebraic constructions codes with the optimal repair bandwidth, and also analyze this parameter for the family of Reed-Solomon codes.
报告人简介：A. Barg is a Professor in the Department of Electrical and Computer Engineering with a joint apppointment at the Institute for Systems Research. He has been a senior reseacher at the IPPI since 1987. He was a member of technical staff of Bell Laboratories of Lucent Technologies in 1997-2002 before joining the faculty at UMD. He is presently an executive editor of IEEE Transactions on Information Theory and also a member of the board of Problems of Information Transmission, International Journal of Coding and Information Theory, and Advances in Mathematics of Communication.