אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

In this talk, we consider locally repairable codes which are optimal with respect to the Singleton-type bound presented by Prakash \emph{et al.} New upper bounds on the length of such optimal codes are derived.

The new bounds both improve and generalize previously known bounds. We also talk about optimal codes, whose length is order-optimal when compared with the new upper bounds. The length of the codes is super-linear in the alphabet size.