Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes
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 lin...
Saved in:
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/156322 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-156322 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1563222023-02-28T20:05:39Z Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes Luo, Gaojun Ling, San School of Physical and Mathematical Sciences Science::Mathematics Linear Code Griesmer Code 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. Nanyang Technological University Submitted/Accepted version This work was supported by NTU Research Grant 04INS000047C230GRT01. 2022-04-16T08:28:41Z 2022-04-16T08:28:41Z 2022 Journal Article 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 0925-1022 https://hdl.handle.net/10356/156322 10.1007/s10623-022-01040-4 en 04INS000047C230GRT01 Designs, Codes and Cryptography © 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, application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Science::Mathematics Linear Code Griesmer Code |
spellingShingle |
Science::Mathematics Linear Code Griesmer Code Luo, Gaojun Ling, San Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes |
description |
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. |
author2 |
School of Physical and Mathematical Sciences |
author_facet |
School of Physical and Mathematical Sciences Luo, Gaojun Ling, San |
format |
Article |
author |
Luo, Gaojun Ling, San |
author_sort |
Luo, Gaojun |
title |
Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes |
title_short |
Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes |
title_full |
Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes |
title_fullStr |
Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes |
title_full_unstemmed |
Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes |
title_sort |
application of optimal p-ary linear codes to alphabet-optimal locally repairable codes |
publishDate |
2022 |
url |
https://hdl.handle.net/10356/156322 |
_version_ |
1759853154483044352 |