Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications
Reference50 articles.
1. Agarwal, A., Barg, A., Hu, S., Mazumdar, A., Tamo, I.: Combinatorial alphabet-dependent bounds for locally recoverable codes. IEEE Trans. Inf. Theory 64, 3481–3492 (2018)
2. Agarwal, A., Mazumdar A.: Bounds on the rate of linear locally repairable codes over small alphabets. arXiv:1607.08547 (2016)
3. Ball, S.: On sets of vectors of a finite space in which every subset of basis size is a basis. J. Eur. Soc. 14, 733–748 (2012)
4. Ball, S., Blokhuis, A.: A bound for the maximum weight of a linear code. SIAM J. Discret. Math. 27(1), 575–583 (2013)
5. Ball, S., De Beule, J.: On sets of vectors of a finite vector space in which every subset of basis size is a basis II. Des. Codes Cryptogr. 65, 5–14 (2012)