February  2022, 16(1): 73-81. doi: 10.3934/amc.2020099

Locally repairable codes with high availability based on generalised quadrangles

1. 

Faculty of Engineering and Natural Sciences, Sabancı University, 34956 Orhanlı, Tuzla, Istanbul, Turkey

2. 

School of Mathematics and Statistics, University of Canterbury, Private Bag 4800, 8140 Christchurch, New Zealand

* Corresponding author: Geertrui Van de Voorde

Received  February 2020 Revised  May 2020 Published  February 2022 Early access  July 2020

Locally Repairable Codes (LRC's) based on generalised quadrangles were introduced by Pamies-Juarez, Hollmann and Oggier in [3], and bounds on the repairability and availability were derived. In this paper, we determine the values of the repairability and availability of such LRC's for a large portion of the currently known generalised quadrangles. In order to do so, we determine the minimum weight of the codes of translation generalised quadrangles and characterise the codewords of minimum weight.

Citation: Michel Lavrauw, Geertrui Van de Voorde. Locally repairable codes with high availability based on generalised quadrangles. Advances in Mathematics of Communications, 2022, 16 (1) : 73-81. doi: 10.3934/amc.2020099
References:
[1] E. F. AssmusJr. and J. D. Key, Designs and Their Codes, Cambridge University Press, Cambridge, 1992.  doi: 10.1017/CBO9781316529836.
[2]

B. Bagchi and N. S. N. Sastry, Codes associated with generalized polygons, Geom. Dedicata, 27 (1988), 1-8.  doi: 10.1007/BF00181609.

[3]

L. Pamies-Juarez, H. D. L. Hollmann and F. Oggier, Locally repairable codes with multiple repair alternatives, In IEEE International Symposium on Information Theory - Proceedings (ISIT), 2013,892–896. doi: 10.1109/ISIT.2013.6620355.

[4]

P. DelsarteJ. M. Goethals and F. J. MacWilliams, On generalized Reed-Muller codes and their relatives, Information and Control, 16 (1970), 403-442.  doi: 10.1016/S0019-9958(70)90214-7.

[5]

P. GopalanC. HuangH. Simitci and and S. Yekhanin, On the locality of codeword symbols, IEEE Trans. Inform. Theory, 58 (2012), 6925-6934.  doi: 10.1109/TIT.2012.2208937.

[6]

S. J. Johnson and S. R. Weller, Codes for iterative decoding from partial geometries, IEEE Trans. Comm., 52 (2004), 236-243.  doi: 10.1109/ISIT.2002.1023582.

[7]

T. Kasami and N. Tokura, On the weight structure of Reed-Muller codes, IEEE Trans. Inf. Theory, 16 (1970), 752-759.  doi: 10.1109/tit.1970.1054545.

[8]

J. L. KimK. E. Mellinger and L. Storme, Small weight codewords in LDPC codes defined by (dual) classical generalised quadrangles, Des. Codes Cryptogr., 42 (2007), 73-92.  doi: 10.1007/s10623-006-9017-6.

[9]

M. Lavrauw, Scattered Subspaces with Respect to Spreads and Eggs in Finite Projective Spaces, PhD thesis, Technical University of Eindhoven, The Netherlands, 2001.

[10]

M. Lavrauw and G. Van de Voorde, Field reduction and linear sets in finite geometry, Topics in Finite Fields, Contemp. Math., volume 632, Amer. Math. Soc., Providence, RI, 2015,271–293. doi: 10.1090/conm/632/12633.

[11]

S. E. Payne and J. A. Thas, Finite Generalized Quadrangles, Pitman Advanced Publishing Program, Boston, MA, 1984.

[12]

V. PepeL. Storme and G. Van de Voorde, Small weight codewords in the LDPC codes arising from linear representations of geometries, J. Combin. Des., 17 (2009), 1-24.  doi: 10.1002/jcd.20179.

[13]

R. Rolland, The second weight of generalized Reed–Muller codes in most cases, Cryptogr. Commun., 2 (2010), 19-40.  doi: 10.1007/s12095-009-0014-2.

[14]

I. TamoA. Barg and A. Frolov, Bounds on the parameters of locally recoverable codes, IEEE Trans. Inform. Theory, 62 (2016), 3070-3083.  doi: 10.1109/TIT.2016.2518663.

[15]

G. Van de Voorde, Blocking Sets in Finite Projective Spaces and Coding Theory, PhD thesis, Ghent University, Belgium, 2010.

show all references

References:
[1] E. F. AssmusJr. and J. D. Key, Designs and Their Codes, Cambridge University Press, Cambridge, 1992.  doi: 10.1017/CBO9781316529836.
[2]

B. Bagchi and N. S. N. Sastry, Codes associated with generalized polygons, Geom. Dedicata, 27 (1988), 1-8.  doi: 10.1007/BF00181609.

[3]

L. Pamies-Juarez, H. D. L. Hollmann and F. Oggier, Locally repairable codes with multiple repair alternatives, In IEEE International Symposium on Information Theory - Proceedings (ISIT), 2013,892–896. doi: 10.1109/ISIT.2013.6620355.

[4]

P. DelsarteJ. M. Goethals and F. J. MacWilliams, On generalized Reed-Muller codes and their relatives, Information and Control, 16 (1970), 403-442.  doi: 10.1016/S0019-9958(70)90214-7.

[5]

P. GopalanC. HuangH. Simitci and and S. Yekhanin, On the locality of codeword symbols, IEEE Trans. Inform. Theory, 58 (2012), 6925-6934.  doi: 10.1109/TIT.2012.2208937.

[6]

S. J. Johnson and S. R. Weller, Codes for iterative decoding from partial geometries, IEEE Trans. Comm., 52 (2004), 236-243.  doi: 10.1109/ISIT.2002.1023582.

[7]

T. Kasami and N. Tokura, On the weight structure of Reed-Muller codes, IEEE Trans. Inf. Theory, 16 (1970), 752-759.  doi: 10.1109/tit.1970.1054545.

[8]

J. L. KimK. E. Mellinger and L. Storme, Small weight codewords in LDPC codes defined by (dual) classical generalised quadrangles, Des. Codes Cryptogr., 42 (2007), 73-92.  doi: 10.1007/s10623-006-9017-6.

[9]

M. Lavrauw, Scattered Subspaces with Respect to Spreads and Eggs in Finite Projective Spaces, PhD thesis, Technical University of Eindhoven, The Netherlands, 2001.

[10]

M. Lavrauw and G. Van de Voorde, Field reduction and linear sets in finite geometry, Topics in Finite Fields, Contemp. Math., volume 632, Amer. Math. Soc., Providence, RI, 2015,271–293. doi: 10.1090/conm/632/12633.

[11]

S. E. Payne and J. A. Thas, Finite Generalized Quadrangles, Pitman Advanced Publishing Program, Boston, MA, 1984.

[12]

V. PepeL. Storme and G. Van de Voorde, Small weight codewords in the LDPC codes arising from linear representations of geometries, J. Combin. Des., 17 (2009), 1-24.  doi: 10.1002/jcd.20179.

[13]

R. Rolland, The second weight of generalized Reed–Muller codes in most cases, Cryptogr. Commun., 2 (2010), 19-40.  doi: 10.1007/s12095-009-0014-2.

[14]

I. TamoA. Barg and A. Frolov, Bounds on the parameters of locally recoverable codes, IEEE Trans. Inform. Theory, 62 (2016), 3070-3083.  doi: 10.1109/TIT.2016.2518663.

[15]

G. Van de Voorde, Blocking Sets in Finite Projective Spaces and Coding Theory, PhD thesis, Ghent University, Belgium, 2010.

[1]

Irene Márquez-Corbella, Edgar Martínez-Moro, Emilio Suárez-Canedo. On the ideal associated to a linear code. Advances in Mathematics of Communications, 2016, 10 (2) : 229-254. doi: 10.3934/amc.2016003

[2]

María Chara, Ricardo A. Podestá, Ricardo Toledano. The conorm code of an AG-code. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021018

[3]

Laura Luzzi, Ghaya Rekaya-Ben Othman, Jean-Claude Belfiore. Algebraic reduction for the Golden Code. Advances in Mathematics of Communications, 2012, 6 (1) : 1-26. doi: 10.3934/amc.2012.6.1

[4]

Serhii Dyshko. On extendability of additive code isometries. Advances in Mathematics of Communications, 2016, 10 (1) : 45-52. doi: 10.3934/amc.2016.10.45

[5]

Andrea Seidl, Stefan Wrzaczek. Opening the source code: The threat of forking. Journal of Dynamics and Games, 2022  doi: 10.3934/jdg.2022010

[6]

Michael Kiermaier, Johannes Zwanzger. A $\mathbb Z$4-linear code of high minimum Lee distance derived from a hyperoval. Advances in Mathematics of Communications, 2011, 5 (2) : 275-286. doi: 10.3934/amc.2011.5.275

[7]

Olof Heden. The partial order of perfect codes associated to a perfect code. Advances in Mathematics of Communications, 2007, 1 (4) : 399-412. doi: 10.3934/amc.2007.1.399

[8]

Sascha Kurz. The $[46, 9, 20]_2$ code is unique. Advances in Mathematics of Communications, 2021, 15 (3) : 415-422. doi: 10.3934/amc.2020074

[9]

Selim Esedoḡlu, Fadil Santosa. Error estimates for a bar code reconstruction method. Discrete and Continuous Dynamical Systems - B, 2012, 17 (6) : 1889-1902. doi: 10.3934/dcdsb.2012.17.1889

[10]

M. Delgado Pineda, E. A. Galperin, P. Jiménez Guerra. MAPLE code of the cubic algorithm for multiobjective optimization with box constraints. Numerical Algebra, Control and Optimization, 2013, 3 (3) : 407-424. doi: 10.3934/naco.2013.3.407

[11]

Jorge P. Arpasi. On the non-Abelian group code capacity of memoryless channels. Advances in Mathematics of Communications, 2020, 14 (3) : 423-436. doi: 10.3934/amc.2020058

[12]

Andrew Klapper, Andrew Mertz. The two covering radius of the two error correcting BCH code. Advances in Mathematics of Communications, 2009, 3 (1) : 83-95. doi: 10.3934/amc.2009.3.83

[13]

Masaaki Harada, Takuji Nishimura. An extremal singly even self-dual code of length 88. Advances in Mathematics of Communications, 2007, 1 (2) : 261-267. doi: 10.3934/amc.2007.1.261

[14]

José Gómez-Torrecillas, F. J. Lobillo, Gabriel Navarro. Information--bit error rate and false positives in an MDS code. Advances in Mathematics of Communications, 2015, 9 (2) : 149-168. doi: 10.3934/amc.2015.9.149

[15]

Evangelos Evangelou. Approximate Bayesian inference for geostatistical generalised linear models. Foundations of Data Science, 2019, 1 (1) : 39-60. doi: 10.3934/fods.2019002

[16]

M. De Boeck, P. Vandendriessche. On the dual code of points and generators on the Hermitian variety $\mathcal{H}(2n+1,q^{2})$. Advances in Mathematics of Communications, 2014, 8 (3) : 281-296. doi: 10.3934/amc.2014.8.281

[17]

Sihuang Hu, Gabriele Nebe. There is no $[24,12,9]$ doubly-even self-dual code over $\mathbb F_4$. Advances in Mathematics of Communications, 2016, 10 (3) : 583-588. doi: 10.3934/amc.2016027

[18]

Anna-Lena Horlemann-Trautmann, Kyle Marshall. New criteria for MRD and Gabidulin codes and some Rank-Metric code constructions. Advances in Mathematics of Communications, 2017, 11 (3) : 533-548. doi: 10.3934/amc.2017042

[19]

Masaaki Harada, Ethan Novak, Vladimir D. Tonchev. The weight distribution of the self-dual $[128,64]$ polarity design code. Advances in Mathematics of Communications, 2016, 10 (3) : 643-648. doi: 10.3934/amc.2016032

[20]

Pedro Branco. A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions. Advances in Mathematics of Communications, 2021, 15 (1) : 113-130. doi: 10.3934/amc.2020046

2020 Impact Factor: 0.935

Metrics

  • PDF downloads (315)
  • HTML views (620)
  • Cited by (0)

Other articles
by authors

[Back to Top]