Two classes of optimal LRCs with information (r, t)-locality
Locally repairable codes (LRCs) with ( r , t )-locality have received considerable attention in recent years, since they are able to solve common problems in distributed storage systems such as repairing multiple node failures and managing hot data. Constructing LRCs with excellent parameters becom...
Saved in:
| Published in | Designs, codes, and cryptography Vol. 88; no. 9; pp. 1741 - 1757 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Springer US
01.09.2020
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0925-1022 1573-7586 |
| DOI | 10.1007/s10623-020-00728-9 |
Cover
Loading…
| Abstract | Locally repairable codes (LRCs) with (
r
,
t
)-locality have received considerable attention in recent years, since they are able to solve common problems in distributed storage systems such as repairing multiple node failures and managing hot data. Constructing LRCs with excellent parameters becomes an interesting research subject in distributed storage systems and coding theory. In this paper, we present two constructions of LRCs with information (
r
,
t
)-locality based on linear algebra and partial geometry, respectively. Both constructions generate LRCs with new parameters which are optimal with respect to the bound proposed by Rawat et al. (IEEE Trans Inf Theory 62(8):4481–4493, 2016). |
|---|---|
| AbstractList | Locally repairable codes (LRCs) with (r, t)-locality have received considerable attention in recent years, since they are able to solve common problems in distributed storage systems such as repairing multiple node failures and managing hot data. Constructing LRCs with excellent parameters becomes an interesting research subject in distributed storage systems and coding theory. In this paper, we present two constructions of LRCs with information (r, t)-locality based on linear algebra and partial geometry, respectively. Both constructions generate LRCs with new parameters which are optimal with respect to the bound proposed by Rawat et al. (IEEE Trans Inf Theory 62(8):4481–4493, 2016). Locally repairable codes (LRCs) with ( r , t )-locality have received considerable attention in recent years, since they are able to solve common problems in distributed storage systems such as repairing multiple node failures and managing hot data. Constructing LRCs with excellent parameters becomes an interesting research subject in distributed storage systems and coding theory. In this paper, we present two constructions of LRCs with information ( r , t )-locality based on linear algebra and partial geometry, respectively. Both constructions generate LRCs with new parameters which are optimal with respect to the bound proposed by Rawat et al. (IEEE Trans Inf Theory 62(8):4481–4493, 2016). |
| Author | Tan, Pan Parampalli, Udaya Sidorenko, Vladimir Zhou, Zhengchun |
| Author_xml | – sequence: 1 givenname: Pan surname: Tan fullname: Tan, Pan organization: School of Information Science and Technology, Southwest Jiaotong University, State Key Laboratory of Cryptology – sequence: 2 givenname: Zhengchun surname: Zhou fullname: Zhou, Zhengchun email: zzc@home.swjtu.edu.cn organization: School of Mathematics, Southwest Jiaotong University – sequence: 3 givenname: Vladimir surname: Sidorenko fullname: Sidorenko, Vladimir organization: Institute for Communications Engineering, Technical University of Munich – sequence: 4 givenname: Udaya surname: Parampalli fullname: Parampalli, Udaya organization: School of Computing and Information Systems, The University of Melbourne |
| BookMark | eNp9kMtKAzEUhoNUsFZfwNWAGwWjJ5lOZrJwIcUbFASp65DJRVOmk5qklL6Nz-KTOe0IgouuDgf-75yf7xgNWt8ahM4IXBOA8iYSYDTHQAF3K60wP0BDUpQ5LouKDdAQOC0wAUqP0HGMcwAgOdAhup2tfaYaGaOJmbeZXya3kE02fZ3EbO3SR-Za68NCJufb7CJcfX-lS9x4JRuXNifo0MommtPfOUJvD_ezyROevjw-T-6mWOUsT9gyQgwoq6GWNWjdleGEGWVrXXNrOWdlrYjRhLISmKFQaMV1qTjXplKW5yN03t9dBv-5MjGJuV-Ftnsp6HhMqmoMRdWlqj6lgo8xGCuUS7viKUjXCAJiK0v0skQnS-xkie0D-g9dhs5D2OyH8h6KXbh9N-Gv1R7qByMPfqQ |
| CitedBy_id | crossref_primary_10_1016_j_disc_2025_114499 crossref_primary_10_1007_s11432_023_3863_y crossref_primary_10_3390_e27030269 crossref_primary_10_1007_s10623_022_01099_z crossref_primary_10_1007_s12095_023_00681_z crossref_primary_10_1109_LCOMM_2021_3075520 |
| Cites_doi | 10.1109/TIT.2014.2325570 10.1109/TIT.2013.2288784 10.1109/TCOMM.2018.2869800 10.14778/2535573.2488339 10.1201/9781420049954 10.1109/TIT.2012.2208937 10.1109/TIT.2018.2876421 10.1109/TIT.2014.2329872 10.1109/TIT.2015.2477406 10.1109/LCOMM.2016.2539160 10.1109/TIT.2014.2351404 10.1109/TIT.2016.2524510 10.1109/ACCESS.2017.2675878 10.1109/ISIT.2017.8006683 10.1109/NCA.2007.37 10.1145/1007352.1007396 10.1109/ISIT.2012.6284028 10.1109/ISIT.2015.7282779 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media, LLC, part of Springer Nature 2020 Springer Science+Business Media, LLC, part of Springer Nature 2020. |
| Copyright_xml | – notice: Springer Science+Business Media, LLC, part of Springer Nature 2020 – notice: Springer Science+Business Media, LLC, part of Springer Nature 2020. |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s10623-020-00728-9 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics Computer Science |
| EISSN | 1573-7586 |
| EndPage | 1757 |
| ExternalDocumentID | 10_1007_s10623_020_00728_9 |
| GroupedDBID | -52 -5D -5G -BR -EM -Y2 -~C .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 2.D 203 28- 29F 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BAPOH BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAK LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P9R PF0 PT4 PT5 QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SDD SDH SDM SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7U Z7X Z7Z Z83 Z88 Z8M Z8R Z8T Z8W Z92 ZMTXR ZWQNP ZY4 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ACSTC ADHKG ADKFA AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION ABRTQ |
| ID | FETCH-LOGICAL-c363t-f611e0cfd0bab0dd092916ecfbdb9ff9967bc1ed126706e205dc9d7c99de8cf93 |
| IEDL.DBID | U2A |
| ISSN | 0925-1022 |
| IngestDate | Fri Jul 25 11:06:16 EDT 2025 Thu Apr 24 23:07:51 EDT 2025 Tue Jul 01 01:18:17 EDT 2025 Fri Feb 21 02:34:08 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 9 |
| Keywords | Partial geometry Repair locality 94B25 11T71 Distributed storage systems Locally repairable codes 94B60 94A60 Multiple failures |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c363t-f611e0cfd0bab0dd092916ecfbdb9ff9967bc1ed126706e205dc9d7c99de8cf93 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | http://mediatum.ub.tum.de/node?id=1540076 |
| PQID | 2441884058 |
| PQPubID | 2043752 |
| PageCount | 17 |
| ParticipantIDs | proquest_journals_2441884058 crossref_citationtrail_10_1007_s10623_020_00728_9 crossref_primary_10_1007_s10623_020_00728_9 springer_journals_10_1007_s10623_020_00728_9 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2020-09-01 |
| PublicationDateYYYYMMDD | 2020-09-01 |
| PublicationDate_xml | – month: 09 year: 2020 text: 2020-09-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York – name: Dordrecht |
| PublicationSubtitle | An International Journal |
| PublicationTitle | Designs, codes, and cryptography |
| PublicationTitleAbbrev | Des. Codes Cryptogr |
| PublicationYear | 2020 |
| Publisher | Springer US Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer Nature B.V |
| References | Hao, Xia (CR8) 2016; 20 Gopalan, Huang, Simitci, Yekhanin (CR7) 2012; 58 CR6 Sidorenko (CR19) 1976; 12 Berman (CR2) 1967; 3 Papailiopoulos, Dimakis (CR14) 2014; 60 CR9 CR15 Rawat, Papailiopoulos, Dimakis, Vishwanath (CR17) 2016; 62 CR13 CR23 CR11 CR10 Wang, Zhang (CR22) 2014; 60 Kamath, Prakash, Lalitha, Kumar (CR12) 2014; 60 Cai, Cheng, Fan, Tang (CR4) 2019; 67 Rawat, Koyluoglu, Silberstein, Vishwanath (CR16) 2014; 60 Asi, Yaakobi (CR1) 2017; 65 Silberstein, Etzion, Schwartz (CR20) 2019; 65 Su (CR21) 2017; 5 Cadambe, Mazumdar (CR3) 2015; 61 Colbourn, Dinitz (CR5) 1996 Sathiamoorthy, Asteris, Papailiopoulos, Dimakis, Vadali, Chen, Borthakur (CR18) 2013; 6 728_CR9 N Silberstein (728_CR20) 2019; 65 AS Rawat (728_CR16) 2014; 60 AS Rawat (728_CR17) 2016; 62 H Asi (728_CR1) 2017; 65 GM Kamath (728_CR12) 2014; 60 DS Papailiopoulos (728_CR14) 2014; 60 M Sathiamoorthy (728_CR18) 2013; 6 Y Su (728_CR21) 2017; 5 CJ Colbourn (728_CR5) 1996 728_CR6 728_CR23 728_CR13 728_CR10 728_CR11 VR Cadambe (728_CR3) 2015; 61 VR Sidorenko (728_CR19) 1976; 12 728_CR15 P Gopalan (728_CR7) 2012; 58 H Cai (728_CR4) 2019; 67 J Hao (728_CR8) 2016; 20 SD Berman (728_CR2) 1967; 3 A Wang (728_CR22) 2014; 60 |
| References_xml | – volume: 60 start-page: 5843 issue: 10 year: 2014 end-page: 5855 ident: CR14 article-title: Locally repairable codes publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2014.2325570 – volume: 60 start-page: 212 issue: 1 year: 2014 end-page: 236 ident: CR16 article-title: Optimal locally repairable and secure codes for distributed storage systems publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2013.2288784 – volume: 12 start-page: 165 issue: 3 year: 1976 end-page: 171 ident: CR19 article-title: Class of correcting codes for errors with a lattice configuration publication-title: Probl. Inform. Transm. – volume: 67 start-page: 39 issue: 1 year: 2019 end-page: 49 ident: CR4 article-title: Optimal locally repairable systematic codes based on packings publication-title: IEEE Trans. Commun. doi: 10.1109/TCOMM.2018.2869800 – volume: 6 start-page: 325 year: 2013 end-page: 336 ident: CR18 article-title: Xoring elephants: novel erasure codes for big data publication-title: Proc. VLDB Endow. doi: 10.14778/2535573.2488339 – ident: CR15 – year: 1996 ident: CR5 publication-title: Handbook of Combinatorial Designs doi: 10.1201/9781420049954 – volume: 58 start-page: 6925 issue: 11 year: 2012 end-page: 6934 ident: CR7 article-title: On the locality of codeword symbols publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2012.2208937 – ident: CR13 – ident: CR10 – ident: CR11 – volume: 65 start-page: 2648 issue: 5 year: 2019 end-page: 2660 ident: CR20 article-title: Locality and availability of array codes constructed from subspaces publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2018.2876421 – ident: CR9 – volume: 60 start-page: 4637 issue: 8 year: 2014 end-page: 4660 ident: CR12 article-title: Codes with local regeneration and erasure correction publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2014.2329872 – volume: 3 start-page: 21 year: 1967 end-page: 30 ident: CR2 article-title: Semisimple cyclic and abelian codes publication-title: Cybernetics – volume: 61 start-page: 5787 issue: 11 year: 2015 end-page: 5794 ident: CR3 article-title: Bounds on the size of locally recoverable codes publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2015.2477406 – ident: CR6 – volume: 20 start-page: 1060 issue: 6 year: 2016 end-page: 1063 ident: CR8 article-title: Constructions of optimal binary locally repairable codes with multiple repair groups publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2016.2539160 – volume: 60 start-page: 6979 issue: 11 year: 2014 end-page: 6987 ident: CR22 article-title: Repair locality with multiple erasure tolerance publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2014.2351404 – volume: 65 start-page: 151 year: 2017 end-page: 155 ident: CR1 article-title: Nearly optimal constructions of PIR and batch codes publication-title: IEEE Inter. Symp. Inf. Theory (ISIT) – volume: 62 start-page: 4481 issue: 8 year: 2016 end-page: 4493 ident: CR17 article-title: Locality and availability in distributed storage publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2016.2524510 – volume: 5 start-page: 3524 year: 2017 end-page: 3528 ident: CR21 article-title: On constructions of a class of binary locally repairable codes with multiple repair groups publication-title: IEEE Access doi: 10.1109/ACCESS.2017.2675878 – ident: CR23 – volume: 60 start-page: 212 issue: 1 year: 2014 ident: 728_CR16 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2013.2288784 – ident: 728_CR13 doi: 10.1109/ISIT.2017.8006683 – volume: 3 start-page: 21 year: 1967 ident: 728_CR2 publication-title: Cybernetics – volume: 67 start-page: 39 issue: 1 year: 2019 ident: 728_CR4 publication-title: IEEE Trans. Commun. doi: 10.1109/TCOMM.2018.2869800 – volume: 60 start-page: 4637 issue: 8 year: 2014 ident: 728_CR12 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2014.2329872 – volume: 58 start-page: 6925 issue: 11 year: 2012 ident: 728_CR7 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2012.2208937 – ident: 728_CR9 doi: 10.1109/NCA.2007.37 – volume: 65 start-page: 151 year: 2017 ident: 728_CR1 publication-title: IEEE Inter. Symp. Inf. Theory (ISIT) – volume: 5 start-page: 3524 year: 2017 ident: 728_CR21 publication-title: IEEE Access doi: 10.1109/ACCESS.2017.2675878 – volume: 61 start-page: 5787 issue: 11 year: 2015 ident: 728_CR3 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2015.2477406 – volume: 60 start-page: 6979 issue: 11 year: 2014 ident: 728_CR22 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2014.2351404 – ident: 728_CR11 doi: 10.1145/1007352.1007396 – ident: 728_CR15 doi: 10.1109/ISIT.2012.6284028 – ident: 728_CR23 doi: 10.1109/ISIT.2015.7282779 – volume: 60 start-page: 5843 issue: 10 year: 2014 ident: 728_CR14 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2014.2325570 – volume: 12 start-page: 165 issue: 3 year: 1976 ident: 728_CR19 publication-title: Probl. Inform. Transm. – volume: 6 start-page: 325 year: 2013 ident: 728_CR18 publication-title: Proc. VLDB Endow. doi: 10.14778/2535573.2488339 – volume: 65 start-page: 2648 issue: 5 year: 2019 ident: 728_CR20 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2018.2876421 – volume: 20 start-page: 1060 issue: 6 year: 2016 ident: 728_CR8 publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2016.2539160 – ident: 728_CR10 – volume: 62 start-page: 4481 issue: 8 year: 2016 ident: 728_CR17 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2016.2524510 – ident: 728_CR6 – volume-title: Handbook of Combinatorial Designs year: 1996 ident: 728_CR5 doi: 10.1201/9781420049954 |
| SSID | ssj0001302 |
| Score | 2.2750127 |
| Snippet | Locally repairable codes (LRCs) with (
r
,
t
)-locality have received considerable attention in recent years, since they are able to solve common problems in... Locally repairable codes (LRCs) with (r, t)-locality have received considerable attention in recent years, since they are able to solve common problems in... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1741 |
| SubjectTerms | Coding and Information Theory Computer Science Cryptology Discrete Mathematics in Computer Science Linear algebra Parameters Special Issue: Coding and Cryptography 2019 Storage systems |
| Title | Two classes of optimal LRCs with information (r, t)-locality |
| URI | https://link.springer.com/article/10.1007/s10623-020-00728-9 https://www.proquest.com/docview/2441884058 |
| Volume | 88 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8JAEJ4oXPTgAzWiaPbgQSObdEsf24MHQkCi4sFAgqeGfZ2UGlrj3_G3-MucLS2gUROPTXcn6czszDfdnW8BzrjRxjDh0wnmL-pNpKBcco96SmH-s5CE297hwX3QH3k3Y39cNIWl5Wn3cksyj9QrzW6YqqktdyzdNS7Tdaj6WLtbvx657UX8tVtxOcOeazk2XbdolflZxtd0tMSY37ZF82zT24GtAiaS9tyuu7CmpzXYLq9gIMWKrMHmCp8gPg0WJKzpHlwN3xIiLTrWKUkMSTA6PKPQu4dOSuz_V1KwplrbkPNZ8-M9u6B5ckNovg-jXnfY6dPitgQqW0EroyZgTDvSKEdMhKMUfj9CPy2NUCIyBuuaUEimFXOD0Am06_hKRiqUUaQ0lyZqHUBlmkz1IRAVCKxWtXKM53macYHuFoWCRR7XiJ-COrBSabEsqMTtjRZP8ZIE2So6RkXHuaLjqA6XizkvcyKNP0c3SlvExaJKY0QijGNB6vM6NEv7LF__Lu3of8OPYcPNXcSeJGtAJZu96hOEHpk4hWr7-vG2e5p73Cc7q8_U |
| linkProvider | Springer Nature |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8JAEJ4oHNSDD9SIzz140OiStrRle_BgiIoKHAwkemrY10UFQ2tM_DX-Fn-Zs2ULaNSEY9Ptpp3HzjfdnW8ADplWWrs8oD2MX9TvCU6ZYD71pcT4ZyAJM7XDrXbY6Po398G9LQpL8tPu-ZZktlJPFbthqKYm3TF01-im81D0MQcPClA8v3q4vRivwGYzLuPY8wzLpufZYpnfZ_kekCYo88fGaBZvLlegm7_p6JjJY-U15RXx_oPEcdZPWYVlC0DJ-chi1mBO9Uuwkjd3INbXS7A0xVSIV60xvWuyDmedtwERBnerhAw0GeC684yTNu_qCTF_donlYzVaJ0fD08-P9JhmYRNB_wZ0Ly869Qa1fRioqIbVlOrQdZUjtHR4jztSolwRVCqhueSR1pgx1bhwlXS9sOaEynMCKSJZE1EkFRM6qm5CoT_oqy0gMuSYByvpaN_3lcs4GnJU46hFphCZhWVwc2XEwpKUm14ZT_GEXtnILkbZxZns4qgMJ-NnXkYUHf-O3s11HFt3TWLEOC7DVDdgZTjNVTa5_fds27MNP4CFRqfVjJvX7dsdWPQyCzDn1XahkA5f1R4CnJTvW3v-Aqbm7iM |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NTsJAEJ4oJkYP_qBGFHUPHjSyoVvasj14IChBBWIMJNwa9u-kQKDG1_FZfDJnSwto1MRj091JOrM780135luAc260MUz4dIDxi3oDKSiX3KOeUhj_LCThtne43QmaPe--7_eXuviTavfsSHLW02BZmoZxeaxMeanxDcM2tamPpb7GLbsKa-iOmS3q6rm1uS-2x3IJ255r-TZdN22b-VnG19C0wJvfjkiTyNPYga0UMpLazMa7sKKHedjOrmMg6e7Mw-YStyA-teeErNM9uO6-jYi0SFlPyciQEXqKFxTaeqpPif0XS1IGVWsncjEpfbzHlzQJdAjT96HXuO3WmzS9OYHKSlCJqQkY0440yhED4SiF348wUEsjlAiNwRynKiTTirlB1Qm06_hKhqoqw1BpLk1YOYDccDTUh0BUIDBz1coxnudpxgUuvbAqWOhxjVgqKADLlBbJlFbc3m7xHC0Ika2iI1R0lCg6CgtwNZ8znpFq_Dm6mNkiSjfYNEJUwjgmpz4vQCmzz-L179KO_jf8DNYfbxpR667zcAwbbrJabIFZEXLx5FWfICKJxWmy6D4BAgfVbw |
| 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=Two+classes+of+optimal+LRCs+with+information+%28r%2C+t%29-locality&rft.jtitle=Designs%2C+codes%2C+and+cryptography&rft.au=Pan%2C+Tan&rft.au=Zhou+Zhengchun&rft.au=Sidorenko%2C+Vladimir&rft.au=Parampalli+Udaya&rft.date=2020-09-01&rft.pub=Springer+Nature+B.V&rft.issn=0925-1022&rft.eissn=1573-7586&rft.volume=88&rft.issue=9&rft.spage=1741&rft.epage=1757&rft_id=info:doi/10.1007%2Fs10623-020-00728-9&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-1022&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-1022&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-1022&client=summon |