Locally repairable codes with high availability based on generalised quadrangles

DOI10.3934/amc.2020099zbMath1489.51003arXiv1912.06372OpenAlexW3045551852MaRDI QIDQ2070258

Michel Lavrauw, Geertrui Van de Voorde

Publication date: 24 January 2022

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.06372

zbMATH Keywords

egglinear codegeneralised quadrangleLRC code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Generalized quadrangles and generalized polygons in finite geometry (51E12) Combinatorial structures in finite projective spaces (51E20)

Cites Work

• Codes associated with generalized polygons
• The second weight of generalized Reed-Muller codes in most cases
• Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
• Bounds on the Parameters of Locally Recoverable Codes
• On the Locality of Codeword Symbols
• Field reduction and linear sets in finite geometry
• Small weight codewords in the LDPC codes arising from linear representations of geometries
• On the weight structure of Reed-Muller codes
• On generalized ReedMuller codes and their relatives
• Unnamed Item
• Unnamed Item

This page was built for publication: Locally repairable codes with high availability based on generalised quadrangles