{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T09:36:42Z","timestamp":1648546602251},"reference-count":15,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:p xml:lang=\"fr\">&lt;p style='text-indent:20px;'&gt;Locally Repairable Codes (LRC's) based on generalised quadrangles were introduced by Pamies-Juarez, Hollmann and Oggier in [&lt;xref ref-type=\"bibr\" rid=\"b3\"&gt;3&lt;\/xref&gt;], 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.&lt;\/p&gt;<\/jats:p>","DOI":"10.3934\/amc.2020099","type":"journal-article","created":{"date-parts":[[2020,8,3]],"date-time":"2020-08-03T11:15:12Z","timestamp":1596453312000},"page":"73","source":"Crossref","is-referenced-by-count":0,"title":["Locally repairable codes with high availability based on generalised quadrangles"],"prefix":"10.3934","volume":"16","author":[{"given":"Michel","family":"Lavrauw","sequence":"first","affiliation":[]},{"given":"Geertrui","family":"Van de Voorde","sequence":"additional","affiliation":[]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2020099-1","doi-asserted-by":"publisher","unstructured":"E. F. Assmus, Jr., J. D. Key., <i>Designs and Their Codes<\/i>, <b>${ref.volume}<\/b> (1992).","DOI":"10.1017\/CBO9781316529836"},{"key":"key-10.3934\/amc.2020099-2","doi-asserted-by":"publisher","unstructured":"B. Bagchi, N. S. N. Sastry.Codes associated with generalized polygons, <i>Geom. Dedicata<\/i>, <b>27<\/b> (1988), 1-8.","DOI":"10.1007\/BF00181609"},{"key":"key-10.3934\/amc.2020099-3","doi-asserted-by":"publisher","unstructured":"L. Pamies-Juarez, H. D. L. Hollmann and F. Oggier, Locally repairable codes with multiple repair alternatives, In <i>IEEE International Symposium on Information Theory - Proceedings (ISIT)<\/i>, 2013,892\u2013896.","DOI":"10.1109\/ISIT.2013.6620355"},{"key":"key-10.3934\/amc.2020099-4","doi-asserted-by":"publisher","unstructured":"P. Delsarte, J. M. Goethals, F. J. MacWilliams.On generalized Reed-Muller codes and their relatives, <i>Information and Control<\/i>, <b>16<\/b> (1970), 403-442.","DOI":"10.1016\/S0019-9958(70)90214-7"},{"key":"key-10.3934\/amc.2020099-5","doi-asserted-by":"publisher","unstructured":"P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin.On the locality of codeword symbols, <i>IEEE Trans. Inform. Theory<\/i>, <b>58<\/b> (2012), 6925-6934.","DOI":"10.1109\/TIT.2012.2208937"},{"key":"key-10.3934\/amc.2020099-6","doi-asserted-by":"publisher","unstructured":"S. J. Johnson, S. R. Weller.Codes for iterative decoding from partial geometries, <i>IEEE Trans. Comm.<\/i>, <b>52<\/b> (2004), 236-243.","DOI":"10.1109\/ISIT.2002.1023582"},{"key":"key-10.3934\/amc.2020099-7","doi-asserted-by":"publisher","unstructured":"T. Kasami, N. Tokura.On the weight structure of Reed-Muller codes, <i>IEEE Trans. Inf. Theory<\/i>, <b>16<\/b> (1970), 752-759.","DOI":"10.1109\/tit.1970.1054545"},{"key":"key-10.3934\/amc.2020099-8","doi-asserted-by":"publisher","unstructured":"J. L. Kim, K. E. Mellinger, L. Storme.Small weight codewords in LDPC codes defined by (dual) classical generalised quadrangles, <i>Des. Codes Cryptogr.<\/i>, <b>42<\/b> (2007), 73-92.","DOI":"10.1007\/s10623-006-9017-6"},{"key":"key-10.3934\/amc.2020099-9","unstructured":"M. Lavrauw, <i>Scattered Subspaces with Respect to Spreads and Eggs in Finite Projective Spaces<\/i>, PhD thesis, Technical University of Eindhoven, The Netherlands, 2001."},{"key":"key-10.3934\/amc.2020099-10","doi-asserted-by":"publisher","unstructured":"M. Lavrauw and G. Van de Voorde, Field reduction and linear sets in finite geometry, <i>Topics in Finite Fields<\/i>, Contemp. Math., volume 632, Amer. Math. Soc., Providence, RI, 2015,271\u2013293.","DOI":"10.1090\/conm\/632\/12633"},{"key":"key-10.3934\/amc.2020099-11","unstructured":"S. E. Payne and J. A. Thas, <i>Finite Generalized Quadrangles<\/i>, Pitman Advanced Publishing Program, Boston, MA, 1984."},{"key":"key-10.3934\/amc.2020099-12","doi-asserted-by":"publisher","unstructured":"V. Pepe, L. Storme, G. Van de Voorde.Small weight codewords in the LDPC codes arising from linear representations of geometries, <i>J. Combin. Des.<\/i>, <b>17<\/b> (2009), 1-24.","DOI":"10.1002\/jcd.20179"},{"key":"key-10.3934\/amc.2020099-13","doi-asserted-by":"publisher","unstructured":"R. Rolland.The second weight of generalized Reed\u2013Muller codes in most cases, <i>Cryptogr. Commun.<\/i>, <b>2<\/b> (2010), 19-40.","DOI":"10.1007\/s12095-009-0014-2"},{"key":"key-10.3934\/amc.2020099-14","doi-asserted-by":"publisher","unstructured":"I. Tamo, A. Barg, A. Frolov.Bounds on the parameters of locally recoverable codes, <i>IEEE Trans. Inform. Theory<\/i>, <b>62<\/b> (2016), 3070-3083.","DOI":"10.1109\/TIT.2016.2518663"},{"key":"key-10.3934\/amc.2020099-15","unstructured":"G. Van de Voorde, <i>Blocking Sets in Finite Projective Spaces and Coding Theory<\/i>, PhD thesis, Ghent University, Belgium, 2010."}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/www.aimsciences.org\/article\/exportPdf?id=c4cfa4d1-2c1d-4613-b43d-8eac1b4a9347","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T11:44:18Z","timestamp":1640864658000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/article\/doi\/10.3934\/amc.2020099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022]]}},"alternative-id":["1930-5346_2022_1_73"],"URL":"https:\/\/doi.org\/10.3934\/amc.2020099","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}