Abstract
Locally repairable codes for distributed storage systems have gained a lot of interest recently, and various constructions can be found in the literature. However, most of the constructions result in either large field sizes and hence too high computational complexity for practical implementation, or in low rates translating into waste of the available storage space.
In this paper we address this issue by developing theory towards code existence and design over a given field. This is done via exploiting recently established connections between linear locally repairable codes and matroids, and using matroid-theoretic characterisations of linearity over small fields. In particular, nonexistence can be shown by finding certain forbidden uniform minors within the lattice of cyclic flats. It is shown that the lattice of cyclic flats of binary matroids have additional structure that significantly restricts the possible locality properties of \(\mathbb {F}_2\)-linear storage codes. Moreover, a collection of criteria for detecting uniform minors from the lattice of cyclic flats of a given matroid is given, which is interesting in its own right.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ball, S.: On sets of vectors of a finite vector space in which every subset of basis size is a basis. J. Eur. Math. Soc. 14, 733–748 (2012)
Bonin, J.E., de Mier, A.: The lattice of cyclic flats of a matroid. Ann. Comb. 12, 155–170 (2008)
Britz, T., Rutherford, C.G.: Covering radii are not matroid invariants. Discrete Math. 296, 117–120 (2005)
Cadambe, V., Mazumdar, A.: An upper bound on the size of locally recoverable codes. In: International Symposium on Network Coding, pp. 1–5 (2013)
Crapo, H., Rota, G.C.: On the Foundations of Combinatorial Theory: Combinatorial Geometries, Preliminary edition edn. MIT Press, Cambridge (1970)
Dimakis, A., Godfrey, P.B., Wu, Y., Wainwright, M.J., Ramchandran, K.: Network coding for distributed storage systems. IEEE Trans. Inf. Theory 56(9), 4539–4551 (2010)
Eberhardt, J.: Computing the tutte polynomial of a matroid from its lattice of cyclic flats. Electron. J. Comb. 21, 12 (2014)
Ernvall, T., Westerbäck, T., Freij-Hollanti, R., Hollanti, C.: Constructions and properties of linear locally repairable codes. IEEE Trans. Inf. Theory 62, 5296–5315 (2016)
Freij-Hollanti, R., Hollanti, C., Westerbäck, T.: Matroid theory and storage codes: bounds and constructions (2017), arXiv: 1704.0400
Geelen, J., Gerards, B., Whittle, G.: Solving Rota’s conjecture. Not. Am. Math. Soc. 61, 736–743 (2014)
Huang, C., Simitci, H., Xu, Y., Ogus, A., Calder, B., Gopalan, P., Li, J., Yekhanin, S.: Erasure coding in Windows Azure storage. In: Proceedings of the USENIX Annual Technical Conference, pp. 15–26 (2012)
Huang, P., Yaakobi, E., Uchikawa, H., Siegel, P.H.: Binary linear locally repairable codes. IEEE Trans. Inf. Theory 62, 5296–5315 (2016)
Papailiopoulos, D., Dimakis, A.: Locally repairable codes. In: International Symposium on Information Theory, pp. 2771–2775. IEEE (2012)
Sathiamoorthy, M., Asteris, M., Papailiopoulos, D., Dimakis, A.G., Vadali, R., Chen, S., Borthakur, D.: Xoring elephants: novel erasure codes for Big Data. Proc. VLDB. 6, 325–336 (2013)
Segre, B.: Curve razionali normali e \(k\)-archi negli spazi finiti. Annali di Matematica 39, 357–359 (1955)
Silberstein, N., Zeh, A.: Optimal binary locally repairable codes via anticodes (2015), arXiv: 1501.07114v1
Tamo, I., Barg, A., Frolov, A.: Bounds on the parameters of locally recoverable codes. IEEE Trans. Inf. Theory 62(6), 3070–3083 (2016)
Tamo, I., Papailiopoulos, D., Dimakis, A.: Optimal locally repairable codes and connections to matroid theory. IEEE Trans. Inf. Theory 62, 6661–6671 (2016)
Tutte, W.: A homotopy theorem for matroids, I, II. Trans. Am. Math. Soc. 88, 148–178 (1958)
Westerbäck, T., Freij-Hollanti, R., Ernvall, T., Hollanti, C.: On the combinatorics of locally repairable codes via matroid theory. IEEE Trans. Inf. Theory 62, 5296–5315 (2016)
Acknowledgment
The authors gratefully acknowledge the financial support from the Academy of Finland (grants #276031 and #303819).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Grezet, M., Freij-Hollanti, R., Westerbäck, T., Hollanti, C. (2017). On Binary Matroid Minors and Applications to Data Storage over Small Fields. In: Barbero, Á., Skachek, V., Ytrehus, Ø. (eds) Coding Theory and Applications. ICMCTA 2017. Lecture Notes in Computer Science(), vol 10495. Springer, Cham. https://doi.org/10.1007/978-3-319-66278-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-66278-7_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-66277-0
Online ISBN: 978-3-319-66278-7
eBook Packages: Computer ScienceComputer Science (R0)