Please use this identifier to cite or link to this item:
|Title:||Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes||Authors:||Luo, Gaojun
|Keywords:||Science::Mathematics||Issue Date:||2022||Source:||Luo, G. & Ling, S. (2022). Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes. Designs, Codes and Cryptography. https://dx.doi.org/10.1007/s10623-022-01040-4||Project:||04INS000047C230GRT01||Journal:||Designs, Codes and Cryptography||Abstract:||Linear codes have widespread applications in data storage systems. There are two major contributions in this paper. We first propose infinite families of optimal or distance-optimal linear codes over Fp constructed from projective spaces.Moreover, a necessary and sufficient condition for such linear codes to be Griesmer codes is presented. Secondly, as an application in data storage systems, we investigate the locality of the linear codes constructed. Furthermore, we show that these linear codes are alphabet-optimal locally repairable codes with locality 2.||URI:||https://hdl.handle.net/10356/156322||ISSN:||0925-1022||DOI:||10.1007/s10623-022-01040-4||Rights:||© 2022 The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature. This is a post-peer-review, pre-copyedit version of an article published in Designs, Codes and Cryptography. The final authenticated version is available online at: http://dx.doi.org/10.1007/s10623-022-01040-4,||Fulltext Permission:||embargo_20230416||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Files in This Item:
|478.96 kB||Adobe PDF||Under embargo until Apr 16, 2023|
Updated on Jul 3, 2022
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.