1 code implementation • 21 Jan 2017 • Anyu Wang, Zhifang Zhang, Dongdai Lin
For binary $[n, k, d]$ linear locally repairable codes (LRCs), two new upper bounds on $k$ are derived.
Information Theory Information Theory