New Constructions of MDS Array Codes and Optimal Locally Repairable Array Codes

MDS array codes have been extensively studied due to their applications in storage systems. In this paper, we first propose a novel method of constructing MDS array codes by deleting one row and one column from the circulant matrices associated to some polynomials. Several new classes of MDS array c...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 70; no. 3; pp. 1806 - 1822
Main Authors Fang, Weijun, Lv, Jingjie, Chen, Bin, Xia, Shu-Tao, Chen, Xiangyu
Format Journal Article
LanguageEnglish
Published New York IEEE 01.03.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithms
Arrays
Blaum-Roth codes
circulant matrices
Codes
Fields (mathematics)
Galois fields
Generators
Linear codes
locally repairable array codes
Maintenance engineering
Mathematical analysis
Matrices (mathematics)
Matrix algebra
MDS array codes
Parity
Polynomials
Redundancy
Storage systems
Symbols
syndrome computation
Online AccessGet full text
ISSN0018-9448
1557-9654
DOI10.1109/TIT.2024.3353111

Cover

Abstract MDS array codes have been extensively studied due to their applications in storage systems. In this paper, we first propose a novel method of constructing MDS array codes by deleting one row and one column from the circulant matrices associated to some polynomials. Several new classes of MDS array codes with flexible parameters are constructed. In particular, we give a new algebraic presentation of the Blaum-Roth codes with sparser parity-check matrices. We also obtain a family of MDS array codes over finite fields with even characteristics whose parity-check matrices have the lowest density. Furthermore, based on these new MDS array codes, we give a general construction of optimal locally repairable array codes (LRACs) achieving the Singleton-type bound. Additionally, we obtain some new optimal LRACs of long lengths. Finally, we present a scheduled algorithm for syndrome computations of binary optimal LRACs with redundancy 4, which can tolerate three failures. The number of XORs per data bit required in our algorithm approaches 2 as the length approaches infinity, which is the same as the MDS codes tolerating three failures. However, the number of nodes required during the repair of a failed node in our optimal LRACs is only about half of that in MDS array codes.
AbstractList MDS array codes have been extensively studied due to their applications in storage systems. In this paper, we first propose a novel method of constructing MDS array codes by deleting one row and one column from the circulant matrices associated to some polynomials. Several new classes of MDS array codes with flexible parameters are constructed. In particular, we give a new algebraic presentation of the Blaum-Roth codes with sparser parity-check matrices. We also obtain a family of MDS array codes over finite fields with even characteristics whose parity-check matrices have the lowest density. Furthermore, based on these new MDS array codes, we give a general construction of optimal locally repairable array codes (LRACs) achieving the Singleton-type bound. Additionally, we obtain some new optimal LRACs of long lengths. Finally, we present a scheduled algorithm for syndrome computations of binary optimal LRACs with redundancy 4, which can tolerate three failures. The number of XORs per data bit required in our algorithm approaches 2 as the length approaches infinity, which is the same as the MDS codes tolerating three failures. However, the number of nodes required during the repair of a failed node in our optimal LRACs is only about half of that in MDS array codes.
Author Lv, Jingjie
Chen, Xiangyu
Fang, Weijun
Chen, Bin
Xia, Shu-Tao
Author_xml – sequence: 1
  givenname: Weijun
  orcidid: 0000-0003-4121-290X
  surname: Fang
  fullname: Fang, Weijun
  email: fwj@sdu.edu.cn
  organization: Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, and the School of Cyber Science and Technology, Shandong University, Qingdao, China
– sequence: 2
  givenname: Jingjie
  orcidid: 0000-0002-7970-9279
  surname: Lv
  fullname: Lv, Jingjie
  email: juxianljj@163.com
  organization: Tsinghua Shenzhen International Graduate School, Tsinghua University, Shenzhen, China
– sequence: 3
  givenname: Bin
  orcidid: 0000-0002-4798-230X
  surname: Chen
  fullname: Chen, Bin
  email: chenbin2021@hit.edu.cn
  organization: Department of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, China
– sequence: 4
  givenname: Shu-Tao
  orcidid: 0000-0002-8639-982X
  surname: Xia
  fullname: Xia, Shu-Tao
  email: xiast@sz.tsinghua.edu.cn
  organization: Tsinghua Shenzhen International Graduate School, Tsinghua University, Shenzhen, China
– sequence: 5
  givenname: Xiangyu
  orcidid: 0000-0002-0648-9164
  surname: Chen
  fullname: Chen, Xiangyu
  email: chenxiangyu9@huawei.com
  organization: Huawei Technologies Company Ltd., Shenzhen, China
BookMark eNpNkEtLAzEQgINUsK3ePXgIeN6a9-NY6qtQLWg9h2x2FrasuzXZIv33ptRDTzPDfDPDfBM06voOELqlZEYpsQ-b5WbGCBMzziWnlF6gMZVSF1ZJMUJjQqgprBDmCk1S2uZSSMrGaP0Ov3jRd2mI-zA0OcF9jd8eP_E8Rn_IrQoS9l2F17uh-fYtXvXBt-0Bf8DON9GXLZyj1-iy9m2Cm_84RV_PT5vFa7FavywX81URmJBDwUFbo5WRXNUKCAvclqIUUgrugzGlrAPRtPSggvUcGJFGEk1IZayuiar4FN2f9u5i_7OHNLhtv49dPumYZVoRrZXIFDlRIfYpRajdLuYn4sFR4o7aXNbmjtrcv7Y8cncaaQDgDOfGCK34H0AmaLE
CODEN IETTAW
Cites_doi 10.1109/9780470544839.ch14
10.1109/TIT.2019.2901492
10.1109/TIT.2009.2013024
10.1145/2421648.2421655
10.1109/ISIT.2017.8006645
10.1145/1542275.1542326
10.1109/TIT.2012.2208937
10.1109/TCOMM.2017.2737441
10.1002/ett.4460030505
10.1145/50202.50214
10.1109/TC.2007.70830
10.1109/TIT.2014.2325570
10.1109/12.364531
10.1109/ISIT.2006.261569
10.1109/TIT.2006.876235
10.1109/ISIT.2019.8849618
10.1109/TIT.2005.855608
10.1109/TIT.2016.2600417
10.1109/ISIT50566.2022.9834665
10.1109/18.485722
10.1109/ISIT.2012.6283534
10.1145/176979.176981
10.1137/0108018
10.1109/TC.2019.2963827
10.1109/18.746771
10.1109/TIT.2014.2329872
10.1109/18.782102
10.1109/TIT.2018.2876421
10.1109/ALLERTON.2010.5706931
10.1109/LCOMM.2019.2911286
10.1109/18.179343
10.1109/TIT.2012.2227110
10.1109/TIT.2019.2951693
10.1109/CMPCON.1989.301912
10.1109/TCOMM.2016.2568205
10.1109/INFCOM.2011.5934901
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TIT.2024.3353111
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1557-9654
EndPage 1822
ExternalDocumentID 10_1109_TIT_2024_3353111
10388476
Genre orig-research
GrantInformation_xml – fundername: National Key Research and Development Program of China
  grantid: 2021YFA1001000; 2022YFA1004900
  funderid: 10.13039/501100012166
– fundername: Natural Science Foundation of Shandong Province
  grantid: ZR2022QA031
  funderid: 10.13039/501100007129
– fundername: Shenzhen Science and Technology Program
  grantid: JCYJ20220818101012025
  funderid: 10.13039/501100017610
– fundername: Taishan Scholar Program of Shandong Province, Guangdong Basic and Applied Basic Research Foundation
  grantid: 2021A1515110066
  funderid: 10.13039/501100021171
– fundername: National Natural Science Foundation of China
  grantid: 62201322; 62301189; 62171248
  funderid: 10.13039/501100001809
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACGFS
ACGOD
ACIWK
AENEX
AETEA
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
F5P
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IDIHD
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNS
RXW
TAE
TN5
VH1
VJK
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c245t-3e798768536f6e02c39b4b45543ac88b5fc071bae6c9a3e205850700d897f06d3
IEDL.DBID RIE
ISSN 0018-9448
IngestDate Mon Jun 30 04:07:08 EDT 2025
Wed Oct 01 02:55:26 EDT 2025
Wed Aug 27 02:17:05 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c245t-3e798768536f6e02c39b4b45543ac88b5fc071bae6c9a3e205850700d897f06d3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-0648-9164
0000-0002-7970-9279
0000-0003-4121-290X
0000-0002-4798-230X
0000-0002-8639-982X
PQID 2927607764
PQPubID 36024
PageCount 17
ParticipantIDs crossref_primary_10_1109_TIT_2024_3353111
ieee_primary_10388476
proquest_journals_2927607764
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2024-03-01
PublicationDateYYYYMMDD 2024-03-01
PublicationDate_xml – month: 03
  year: 2024
  text: 2024-03-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on information theory
PublicationTitleAbbrev TIT
PublicationYear 2024
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref34
ref15
ref37
ref36
ref31
ref30
ref11
ref33
ref10
ref32
ref2
ref1
ref17
ref39
ref16
ref38
ref19
ref18
ref24
ref23
MacWilliams (ref29) 1991
ref25
ref20
ref41
ref22
ref21
ref28
ref27
ref8
ref9
ref4
ref3
ref6
ref5
Blaum (ref7) 1998
ref40
Lidl (ref26) 1997
Rashmi (ref35)
Corbett (ref14)
References_xml – ident: ref4
  doi: 10.1109/9780470544839.ch14
– ident: ref22
  doi: 10.1109/TIT.2019.2901492
– volume-title: The Theory Error-Correcting Codes
  year: 1991
  ident: ref29
– start-page: 1
  volume-title: Proc. 5th USENIX Workshop Hot Topics Storage File Syst. (Hot Storage)
  ident: ref35
  article-title: A solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the Facebook warehouse cluster
– ident: ref11
  doi: 10.1109/TIT.2009.2013024
– ident: ref16
  doi: 10.1145/2421648.2421655
– ident: ref19
  doi: 10.1109/ISIT.2017.8006645
– ident: ref12
  doi: 10.1145/1542275.1542326
– start-page: 1
  volume-title: Proc. 3rd USENIX Conf. File Storage Technol. (FAST)
  ident: ref14
  article-title: Row-diagonal parity for double disk failure correction
– ident: ref17
  doi: 10.1109/TIT.2012.2208937
– ident: ref24
  doi: 10.1109/TCOMM.2017.2737441
– ident: ref15
  doi: 10.1002/ett.4460030505
– ident: ref34
  doi: 10.1145/50202.50214
– ident: ref21
  doi: 10.1109/TC.2007.70830
– ident: ref32
  doi: 10.1109/TIT.2014.2325570
– ident: ref3
  doi: 10.1109/12.364531
– ident: ref2
  doi: 10.1109/ISIT.2006.261569
– start-page: 1855
  volume-title: Handbook of Coding Theory
  year: 1998
  ident: ref7
  article-title: Array codes
– ident: ref27
  doi: 10.1109/TIT.2006.876235
– ident: ref20
  doi: 10.1109/ISIT.2019.8849618
– ident: ref39
  doi: 10.1109/TIT.2005.855608
– volume-title: Finite Fields
  year: 1997
  ident: ref26
– ident: ref25
  doi: 10.1109/TIT.2016.2600417
– ident: ref28
  doi: 10.1109/ISIT50566.2022.9834665
– ident: ref5
  doi: 10.1109/18.485722
– ident: ref30
  doi: 10.1109/ISIT.2012.6283534
– ident: ref13
  doi: 10.1145/176979.176981
– ident: ref36
  doi: 10.1137/0108018
– ident: ref41
  doi: 10.1109/TC.2019.2963827
– ident: ref10
  doi: 10.1109/18.746771
– ident: ref23
  doi: 10.1109/TIT.2014.2329872
– ident: ref40
  doi: 10.1109/18.782102
– ident: ref37
  doi: 10.1109/TIT.2018.2876421
– ident: ref1
  doi: 10.1109/ALLERTON.2010.5706931
– ident: ref6
  doi: 10.1109/LCOMM.2019.2911286
– ident: ref9
  doi: 10.1109/18.179343
– ident: ref38
  doi: 10.1109/TIT.2012.2227110
– ident: ref8
  doi: 10.1109/TIT.2019.2951693
– ident: ref33
  doi: 10.1109/CMPCON.1989.301912
– ident: ref18
  doi: 10.1109/TCOMM.2016.2568205
– ident: ref31
  doi: 10.1109/INFCOM.2011.5934901
SSID ssj0014512
Score 2.4526546
Snippet MDS array codes have been extensively studied due to their applications in storage systems. In this paper, we first propose a novel method of constructing MDS...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Index Database
Publisher
StartPage 1806
SubjectTerms Algorithms
Arrays
Blaum-Roth codes
circulant matrices
Codes
Fields (mathematics)
Galois fields
Generators
Linear codes
locally repairable array codes
Maintenance engineering
Mathematical analysis
Matrices (mathematics)
Matrix algebra
MDS array codes
Parity
Polynomials
Redundancy
Storage systems
Symbols
syndrome computation
Title New Constructions of MDS Array Codes and Optimal Locally Repairable Array Codes
URI https://ieeexplore.ieee.org/document/10388476
https://www.proquest.com/docview/2927607764
Volume 70
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1557-9654
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014512
  issn: 0018-9448
  databaseCode: RIE
  dateStart: 19630101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwED7RTjBQKEUUCvLAwpA2iR0nGRFQFUTbgVbqFjnORUJAivoYyq_nnAcqICS2SHEcy-f77s72fQdwKWUQigBTyxVotm40t1TMFak7JkojBWN5HvdwJAdT8TDzZmWyep4Lg4j55TPsmsf8LD-Z67XZKusZMm9CU1mDmh_IIlnr68hAeE5BDe6QBlPQUZ1J2mFvcj-hSNAVXc5pyTnONxuUF1X5hcS5eek3YFQNrLhV8tJdr-Ku_vjB2fjvkR_AfulosutiZRzCDmZNaFRFHFip003Y22IkPIIxgR4zRTwrWtklm6dsePtEHS3Uhl4luGQqS9iYsOaNfvBojOHrhpEnr54XJhFru2kLpv27yc3AKmsuWNoV3sri6IcEkGTEZSrRdjUPYxELcjq40kEQe6kmpyRWKHWoOLo2hRuEGnYShH5qy4QfQz2bZ3gCzNFukigCEO1zQY4UKXiA1MRPPcU1D9pwVUkhei-oNaI8JLHDiCQWGYlFpcTa0DKTutWumM82dCq5RaXyLSM3dH1paIrE6R-fncGu6b24S9aBOs0pnpNzsYov8kX1CV5pyOk
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwED7xGICBZxGFAh5YGJImseMkI-KhFtoyECS2yHEuEgJS1JYBfj3nPFABIbFFihNbPt93d7bvO4ATKcNIhJhbnkCzdaO5pVKuSN0xUxopGCvzuIcj2bsX1w_-Q52sXubCIGJ5-Qxt81ie5Wdj_Wa2yrqGzJvQVC7Csi-E8Kt0ra9DA-G7FTm4SzpMYUdzKulE3bgfUyzoCZtzWnSu-80KlWVVfmFxaWCuNmDUDK26V_Jkv81SW3_8YG3899g3Yb12NdlZtTa2YAGLbdhoyjiwWqu3YW2Ok3AHbgn2mCnj2RDLTtk4Z8OLO_rRRL3TqwynTBUZuyW0eaEOBsYcPr8z8uXV48SkYs03bcH91WV83rPqqguW9oQ_szgGEUEkmXGZS3Q8zaNUpILcDq50GKZ-rsktSRVKHSmOnkMBB-GGk4VRkDsy47uwVIwL3APmai_LFEGIDrggV4pUPERqEuS-4pqHbThtpJC8VuQaSRmUOFFCEkuMxJJaYm1omUmda1fNZxs6jdySWv2miRd5gTRERWL_j8-OYaUXDwfJoD-6OYBV01N1s6wDSzS_eEiuxiw9KhfYJxMazDY
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=New+Constructions+of+MDS+Array+Codes+and+Optimal+Locally+Repairable+Array+Codes&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Fang%2C+Weijun&rft.au=Lv%2C+Jingjie&rft.au=Chen%2C+Bin&rft.au=Xia%2C+Shu-Tao&rft.date=2024-03-01&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=70&rft.issue=3&rft.spage=1806&rft.epage=1822&rft_id=info:doi/10.1109%2FTIT.2024.3353111&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TIT_2024_3353111
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon